K-divisible Sum

题意翻译

你有两个正整数 $n$ 和 $k$。($1 \leq n, k \leq 10^9$) 请尝试构造出一个长度为 $n$ 的**正整数**数列，使它各个数和能被 $k$ 整除，并使这个数列里的**最大数**尽可能的**小**。输出这个最小值。 本题每个测试点里有多组数据，第一行输入数据组数 $t$，之后的 $t$ 行每行输入两个正整数，表示 $n$ 和 $k$。 对于每一组数据，输出一行，表示答案。 Translated By @[NSObject](https://www.luogu.com.cn/user/357545).

题目描述

You are given two integers $ n $ and $ k $ . You should create an array of $ n $ positive integers $ a_1, a_2, \dots, a_n $ such that the sum $ (a_1 + a_2 + \dots + a_n) $ is divisible by $ k $ and maximum element in $ a $ is minimum possible. What is the minimum possible maximum element in $ a $ ?

输入输出格式

输入格式

The first line contains a single integer $ t $ ( $ 1 \le t \le 1000 $ ) — the number of test cases. The first and only line of each test case contains two integers $ n $ and $ k $ ( $ 1 \le n \le 10^9 $ ; $ 1 \le k \le 10^9 $ ).

输出格式

For each test case, print one integer — the minimum possible maximum element in array $ a $ such that the sum $ (a_1 + \dots + a_n) $ is divisible by $ k $ .

输入输出样例

输入样例 #1

4
1 5
4 3
8 8
8 17

输出样例 #1

5
2
1
3

说明

In the first test case $ n = 1 $ , so the array consists of one element $ a_1 $ and if we make $ a_1 = 5 $ it will be divisible by $ k = 5 $ and the minimum possible. In the second test case, we can create array $ a = [1, 2, 1, 2] $ . The sum is divisible by $ k = 3 $ and the maximum is equal to $ 2 $ . In the third test case, we can create array $ a = [1, 1, 1, 1, 1, 1, 1, 1] $ . The sum is divisible by $ k = 8 $ and the maximum is equal to $ 1 $ .