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.
//package codes;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.stream.Collectors;

//import codes.Reference.i;

public class BuyingShovels {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		long t;
		
		t = i.l();
		
		while(t>0)
		{
			long a[]=i.la();
			long n = a[0];
			long k = a[1];
			if(n<=k)
				System.out.println(1);
			else
			{
				long ans=n;
				for(int i=2;i<=Math.sqrt(n);i++)
				{
					if(n%i==0)
					{
						if(i <= k)
							ans = Math.min(ans, n/i);
						if(n/i <= k)
							ans = Math.min(ans, i);
					}
					
					
				}
				System.out.println(ans);
			}
			t--;	
		}
	}
	static private class i
	{
		//input taking methods
		static BufferedReader b = new BufferedReader(new InputStreamReader(System.in));
		
		public static String[] sa()
	    {
	    	try {
				return b.readLine().split(" ");
			} catch (IOException e) {
				
				e.printStackTrace();
			}
	    	return null;
	    }
		
		public static long l()
		{
			try {
				return Long.parseLong(b.readLine());
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
	    	return 0;
		}
		
		public static String s()
		{
			try {
				return b.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
	    	return null;
		}
		
		public static long[] la()
		{
			return Arrays.stream(sa()).parallel().mapToLong(Long::parseLong).toArray();
		}
		
		public static ArrayList<Long> lal()
		{
			return (ArrayList<Long>)Arrays.stream(la()).parallel().boxed().collect(Collectors.toList());
		}
		public static StringBuilder so(String a)
		{
			return new StringBuilder(a);
		}

	}
	/*
	 HashMap<String,Integer> map = new HashMap<String,Integer>();
	 if(!map.containsKey(key))
	 {
	 	map.put(key,value);
	 }
	 else
	 {
	 	map.replace(key,map.get(key));
	 } 
	 */
	static private class algo{
		
		public static boolean isPrime(int a)
		{
			for(int i=2;i<a;i++)
			{
				if(a%i==0)
				{
					return false;
				}
			}
			return true;
		}
		static String reverse(String s)
		{
			return i.so(s).reverse().toString();
		}
		static String replace(String s,int st,int e,String repl)
		{
			return i.so(s).replace(st, e, repl).toString();
		}
		static String insert(String s,int pos,String ins)
		{
			return i.so(s).insert(pos, ins).toString();
		}
		static long sod(long n) 
	    { 
	        long sum; 
	        for (sum = 0; n > 0; sum += n % 10, 
	                                  n /= 10); 
	  
	        return sum; 
	    } 

		static int gcd(int a, int b) 
	    { 
			if (a == 0) 
				return b;  
			return gcd(b % a, a);  
	    } 
		
	    static int lcm(int a, int b) 
	    { 
	        return (a*b)/gcd(a, b); 
	    }
	    static long sumOfSquares(long[] a)
	    {
	    	
	    	return (long) Arrays.stream(a).mapToDouble(i->i*i).sum();
	    }
	    //use of filter
	    //Arrays.stream(a).filter(k->k==1).count();
	    //            array       variable->condition returning boolean  . lot fof functionsa re available
	    
	    static String[] generateBinSeq(int cnt)
	    {
	    	int loopvar=(int) Math.pow(2, cnt);
			String a[][] = new String[cnt+1][loopvar];
			
			for(int i=1;i<=cnt;i++)
			{
				int temp = (int) Math.pow(2, i);
				for(int j=0;j<temp;j++)
				{
					if(i==1 || i==2)
					{
						if(i==1)
						{
							a[i][0]="0";
							a[i][1]="1";
							continue;
						}
						else
						{
							a[2][0]="00";a[2][1]="01";a[2][2]="10";a[2][3]="11";
							continue;
						}
					}
					else
					{
						if(j<(temp/2))
						{
							a[i][j] = a[i-1][j]+"0"; 
						}
						else
						{
							a[i][j] = a[i-1][j%((temp+1)/2)]+"1";
						}
				
					}
						
				}
			}
	    
			return a[cnt];
	    }
	    
	 // USe this snippet for calling
//	    int ndx = algo.bs(a,key,0,a.length-1);
//		if(ndx<0)
//			ndx=0;
//		if(ndx==a.length)
//			ndx=a.length-1;

	    static public int bs(long a[],long key,int s,int e)
		{
			int m = (s+e)/2;
			if(s>e)
				return s;
				
			if(a[m]==key)
				return m;
			else if(a[m]>key)
				return bs(a,key,s,m-1);
			else
				return bs(a,key,m+1,e);
			
		}
	 // USe this snippet for calling
//	    int ndx = bsa(al,key,0,al.size()-1);
//		if(ndx<0)
//			ndx=0;
//		if(ndx==al.size())
//			ndx=al.size()-1;
	    static public int bsa(ArrayList<Long> a,long key,int s,int e)
		{
			int m = (s+e)/2;
			if(s>e)
				return s;
				
			if(a.get(m)==key)
				return m;
			else if(a.get(m)>key)
				return bsa(a,key,s,m-1);
			else
				return bsa(a,key,m+1,e);
			
		}
	    static public long fact(long a)
	    {
	    	long i,fact=1;  
	    	 long number=a;   
	    	  for(i=1;i<=number;i++){    
	    	      fact=fact*i;    
	    	  } 
	    	  return fact;
	    }
	    
	}
}
