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 ≤ i ≤ 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. 

Input

The first line contains an integer t (1 ≤ t ≤ 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 ≤ n ≤ 10^9) and k (1 ≤ k ≤ 10^9) — the number of shovels and the number of types of packages.

Output

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

Example

Input


5
8 7
8 1
6 10
999999733 999999732
999999733 999999733


Output


2
8
1
999999733
1

Note

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.
import java.io.*;
import java.math.*;
import java.util.*;

public class Codeforce {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        Solver solver = new Solver();
        solver.solve(in,out);
        out.close();

    }

    static class Solver{
        boolean[] visited;
        ArrayList<Integer>[] adjList;
        final long MOD = 1000000007;
        int[] order;
        int[] orderFreq;
        boolean prime[];
        ArrayList<Integer> primee;

        public void solve(InputReader in, OutputWriter out){
            prime = new boolean[100000];
            primee = new ArrayList<>();
            int t = in.nextInt();
            for(int i = 0; i < t; i++){
                long n = in.nextInt();
                long k = in.nextInt();
                if(k>=n){
                    out.printf("%d\n",1);
                    continue;
                }
                long ind = 2;
                long max = Math.min(k, (long) Math.sqrt(n));
                long last = -1;
                boolean found = false;
                while(ind <= max){
                    if(n%ind == 0){
                        if(n/ind <= k){
                            out.printf("%d\n", ind);
                            found = true;
                            break;
                        }
                        last = ind;
                    }
                    ind++;
                }
                if(last != -1 && !found)out.printf("%d\n", n/last);
                else if(!found) out.printf("%d\n", n);
            }
        }

        void sieveOfEratosthenes(int n)
        {

            for(int p = 2; p*p <=n; p++)
            {
                // If prime[p] is not changed, then it is a prime
                if(prime[p] == false)
                {
                    // Update all multiples of p
                    for(int i = p*p; i <= n; i += p)
                        prime[i] = true;
                }
            }
            for(int i = 2; i <= n; i++)
            {
                if(prime[i] == false) primee.add(i);
            }
        }

        private void swap(int[] arr, int a, int b){
            int temp = arr[a];
            arr[a] = arr[b];
            arr[b] = temp;
        }
        public int gcd(int a, int b) {
            if (b==0) return a;
            return gcd(b,a%b);
        }
        public long gcd(long a, long b) {
            if (b==0) return a;
            return gcd(b,a%b);
        }

        private void initAdjList(int n){
            adjList = new ArrayList[n];
            visited = new boolean[n];
            for(int i=0;i<n;i++){
                adjList[i] = new ArrayList<>();
            }
        }

        class Edge{
            int weight;
            int node;
            public  Edge(int node, int weight){
                this.node = node;
                this.weight = weight;
            }
        }

        private  int[] nextAInt(int n, InputReader in){
            int arr[] = new int[n];
            for(int i=0;i<n;i++){
                arr[i]= in.nextInt();
            }
            return arr;
        }

        private  long[] nextALong(int n, InputReader in){
            long arr[] = new long[n];
            for(int i=0;i<n;i++){
                arr[i]= in.nextInt();
            }
            return arr;
        }
    }


    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1 << 16];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (this.numChars == -1) {
                throw new InputMismatchException();
            } else {
                if (this.curChar >= this.numChars) {
                    this.curChar = 0;

                    try {
                        this.numChars = this.stream.read(this.buf);
                    } catch (IOException var2) {
                        throw new InputMismatchException();
                    }

                    if (this.numChars <= 0) {
                        return -1;
                    }
                }

                return this.buf[this.curChar++];
            }
        }

        public int nextInt() {
            int c;
            for (c = this.read(); isSpaceChar(c); c = this.read()) {
                ;
            }

            byte sgn = 1;
            if (c == 45) {
                sgn = -1;
                c = this.read();
            }

            int res = 0;

            while (c >= 48 && c <= 57) {
                res *= 10;
                res += c - 48;
                c = this.read();
                if (isSpaceChar(c)) {
                    return res * sgn;
                }
            }

            throw new InputMismatchException();
        }

        public String next() {
            int c;
            while (isSpaceChar(c = this.read())) {
                ;
            }

            StringBuilder result = new StringBuilder();
            result.appendCodePoint(c);

            while (!isSpaceChar(c = this.read())) {
                result.appendCodePoint(c);
            }

            return result.toString();
        }

        public static boolean isSpaceChar(int c) {
            return c == 32 || c == 10 || c == 13 || c == 9 || c == -1;
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void printf(String format, Object... objects) {
            writer.printf(format, objects);
        }

        public void close() {
            writer.close();
        }

    }


}
