Lower Bound

// Lower Bound is x is arr[i] >= x
#include<bits/stdc++.h>
using namespace std;
#define cpp ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n';
int binarySearch(int a[],int n,int tar,int ans){
	int low=0,high=n-1;
	int mid = (low+high)/2;
	while(low<=high){
		mid = low + (high-low)/2;
			if (a[mid]<tar)
			{
				low = mid+1;
			}else{
				if (a[mid]>=tar)
				{
					ans = mid;
				}
				high = mid-1;
			}
		}
	return ans;
}
int main(){
	cpp
	int t;
	cin>>t;
	while(t--){
	int n,tar;
	cin>>n>>tar;
	int a[n];
	for (int i = 0; i < n; ++i)
	{
		cin>>a[i];
	}
	sort(a,a+n);
	int ans = n;
	cout<<binarySearch(a,n,tar,ans)<<endl;
}
}