Buying Shovels

题意翻译

题目大意：有$k$种包裹 第$i$种包裹有$i$个物品（$ 1 \leq i$ $ \leq k $) 现在需要**恰好**买$n$个物品 只能购买一种包裹，但可以购买无数次 求最少的购买次数

题目描述

Polycarp wants to buy exactly $ n $ shovels. The shop sells packages with shovels. The store has $ k $ types of packages: the package of the $ i $ -th type consists of exactly $ i $ shovels ( $ 1 \le i \le k $ ). The store has an infinite number of packages of each type. Polycarp wants to choose one type of packages and then buy several (one or more) packages of this type. What is the smallest number of packages Polycarp will have to buy to get exactly $ n $ shovels? For example, if $ n=8 $ and $ k=7 $ , then Polycarp will buy $ 2 $ packages of $ 4 $ shovels. Help Polycarp find the minimum number of packages that he needs to buy, given that he: - will buy exactly $ n $ shovels in total; - the sizes of all packages he will buy are all the same and the number of shovels in each package is an integer from $ 1 $ to $ k $ , inclusive.

输入输出格式

输入格式

The first line contains an integer $ t $ ( $ 1 \le t \le 100 $ ) — the number of test cases in the input. Then, $ t $ test cases follow, one per line. Each test case consists of two positive integers $ n $ ( $ 1 \le n \le 10^9 $ ) and $ k $ ( $ 1 \le k \le 10^9 $ ) — the number of shovels and the number of types of packages.

输出格式

Print $ t $ answers to the test cases. Each answer is a positive integer — the minimum number of packages.

输入输出样例

输入样例 #1

5
8 7
8 1
6 10
999999733 999999732
999999733 999999733

输出样例 #1

2
8
1
999999733
1

说明

The answer to the first test case was explained in the statement. In the second test case, there is only one way to buy $ 8 $ shovels — $ 8 $ packages of one shovel. In the third test case, you need to buy a $ 1 $ package of $ 6 $ shovels.