#include<iostream>
#include<map>
#include<set>
#include<algorithm>
using namespace std;



int main(){
    int T;
    scanf("%d",&T);
    while(T){
        multiset<int> vec[110];
        set<int> s;
        int a[110];
        int vec_size = 0;
        int n;
        cin>>n;
        for(int i=0;i<n;i++){
            cin>>a[i];
            s.insert(a[i]);
        }
        for(int i=0;i<n;i++){
            int b;
            cin>>b;
            vec[b].insert(a[i]);
            vec_size = max(b,vec_size);
        }
        for(int i=1;i<=vec_size;i++){
            auto iter = s.begin();
            cout<<i<<"={"<< *iter<<"="<<vec[i].count(*iter);
            iter++;
            while(iter != s.end()) {
                cout <<","<<*iter<<"="<< vec[i].count(*iter);
                iter++;
            }
            cout<<"}"<<endl;
        }
        T--;
    }
}