#include <iostream>

using namespace std;

#define MAX_N 110

int N;
int r[MAX_N];
int k[MAX_N];
int Result = 0;
void swap(int a[], int left, int right){
    int temp = a[left];
    a[left] = a[right];
    a[right] = temp;
}
void quickSort(int a[], int left, int right){
    int pivot, i, j;
    if(left<right){
        i = left, j = right +1, pivot = a[left];
        do
        {
            do
            i++;
            while(a[i] < pivot);
            do
            j--;
            while(a[j] > pivot);
            if(i<j) swap(a, i, j);
        }while(i<j);
        swap(a, left, j);
        quickSort(a, left, j-1);
        quickSort(a, j+1, right);
    }
}

void judge(){
    // i, j
    // i : r의 index
    // j : k의 index
    int i,j;
    for(i=0,j=0; j<N;){
        if(r[i]> k[j]) j++;
        else if(r[i] <= k[j]) {
            i++, j++;
            Result++;
        }
    }
}

void init(){
    N=0;
    for(int i=0; i<MAX_N; i++)  r[i] = k[i] = 0;
    Result = 0;
}

int main(int argc, char** argv)
{
    int test_case;
    int T;

    cin >> T;
    for(test_case = 0; test_case < T; test_case++)
    {
        init();
        cin>>N;
        for(int i=0; i<N; i++)  cin>>r[i];
        for(int i=0; i<N; i++)  cin>>k[i];

        quickSort(r, 0, N-1);
        quickSort(k, 0, N-1);

        judge();
        cout<<Result<<endl;

    }

    return 0;
}