There are n programmers that you want to split into several non-empty teams. The skill of the i-th programmer is a_i. You want to assemble the maximum number of teams from them. There is a restriction for each team: the number of programmers in the team multiplied by the minimum skill among all programmers in the team must be at least x.

Each programmer should belong to at most one team. Some programmers may be left without a team.

Calculate the maximum number of teams that you can assemble.

Input

The first line contains the integer t (1 ≤ t ≤ 1000) — the number of test cases.

The first line of each test case contains two integers n and x (1 ≤ n ≤ 10^5; 1 ≤ x ≤ 10^9) — the number of programmers and the restriction of team skill respectively.

The second line of each test case contains n integers a_1, a_2, ... , a_n (1 ≤ a_i ≤ 10^9), where a_i is the skill of the i-th programmer.

The sum of n over all inputs does not exceed 10^5.

Output

For each test case print one integer — the maximum number of teams that you can assemble. 

Example

Input


3
5 10
7 11 2 9 5
4 8
2 4 2 3
4 11
1 3 3 7


Output


2
1
0
import java.io.*;
import java.util.*;




public class CodeForce {
 static ArrayList<Integer> inputarrlist(String s){
     String[] str=s.split(" ");
     ArrayList<Integer> arr=new ArrayList<>();
     for(int i=0;i<str.length;i++)
         arr.add(Integer.parseInt(str[i]));
     
     return arr;
 }
 static long[] inputarrlong(String s){
     String[] str=s.split(" ");
     long[] arr=new long[str.length];
     for(int i=0;i<str.length;i++)
         arr[i]=(Long.parseLong(str[i]));
     
     return arr;
 }
 
 static int[] inputarrint(String s){
     String[] str=s.split(" ");
     int[] arr=new int[str.length];
     for(int i=0;i<str.length;i++)
         arr[i]=Integer.parseInt(str[i]);
     
     return arr;
 }
 
 static int powermod(long x, long y, long mod){
  long ans = 1;
  while(y>0){
      if (y%2==1)
           ans = (ans*x)%mod;
           x = (x*x)%mod;
	   y/=2;
            }
   return (int)(ans);
	}
 
 static int power(long x, long y){
  long ans = 1;
  while(y>0){
      if (y%2==1)
           ans=ans*x;
           x=(x*x);
	   y/=2;
            }
   return (int)(ans);
	}
 
 static StringBuffer rrotatestring(StringBuffer sb,int a){
     int len=sb.length();
     StringBuffer temp;
      temp=new StringBuffer(sb.substring(len-a, len));
      sb.delete(len-a,len);
      sb.insert(0,temp);
      return sb;
 }
 
 static StringBuffer lrotatestring(StringBuffer sb,int a){
     int len=sb.length();
     StringBuffer temp;
      temp=new StringBuffer(sb.substring(0,a));
      sb.delete(0,a);
      sb.append(temp);
      return sb;
 }
 static long gcd(long a, long b) 
    { 
      if (b==0) 
        return a; 
      return gcd(b, a % b);  
    } 
 
 static long lcm(long a,long b) 
    { 
        return (a*b)/gcd(a, b); 
    } 
 
 
 static ArrayList<Long> allfactorsofn(long n) 
    { 
        ArrayList<Long> a=new ArrayList<>();
        ArrayList<Long> b=new ArrayList<>();
        for (long i=1; i<=Math.sqrt(n); i++) 
        { if (n%i==0) 
            {  
                if (n/i == i) 
                    a.add(i); 
       
                else 
                {
                    a.add(i);
                    b.add(n/i);
                }
            } 
        } 
        
        for(int i=b.size()-1;i>=0;i--){
            a.add(b.get(i));
        }
        
        return a;
    } 
 
    public static void main(String[] args) throws IOException {
        
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t;
        
        //t=1;

        t=Integer.parseInt(br.readLine());
        
        while(t-->0){
             String[] str=br.readLine().split(" ");
           long[] arr=inputarrlong(br.readLine());
           int n=Integer.parseInt(str[0]);
           long x=Long.parseLong(str[1]);
           
           Arrays.sort(arr);
           int f=0;
           long c=0;
           int count=0;
           
           for(int i=n-1;i>=0;i--){
               
               if(f==0){
                   if(arr[i]>=x){
                       count++;
                       //System.out.println(1+" "+arr[i]);
                   }
                   else
                       f=1;
               }
               if(f==1){
                   c++;
                   
                   if(arr[i]*c>=x){
                       count++;
                       c=0;
                   }
               }
           }
           
            System.out.println(count);
        }
    }

class Sample{
            int x;
            int y;
            Sample(int x, int y){
                this.x= x;
                this.y=y;
            }
        }
        class SortSample implements Comparator<Sample>{
            public int compare(Sample a ,Sample b){
                if(a.x!=b.x)
                return a.x-b.x;
                else
                    return a.y-b.y;
            }
        }
}