#include<bits/stdc++.h>
using namespace std;

struct team{
    int cnt,tim;
    int init_cnt,init_tim;
    int ac[26],wa[26];
    int AC[26],tot[26];
    vector<pair<int,int> >v[26];

    team():cnt(0),tim(0){
        for(int i=0;i<26;i++){
            ac[i]=wa[i]=0;
            AC[i]=tot[i]=0;
            v[i].clear();
        }
    }

    inline pair<int,int> insert(int op,int tim,int flag){
        int useful=(flag?(ac[op]==0):(wa[op]==0));
        flag?ac[op]=1:wa[op]=1;

        v[op].push_back({tim,flag});
        return {v[op].size()-1,useful};
    }

    inline void reset(){
        cnt=init_cnt,tim=init_tim;
    }
    
    inline void cal(int x=-1,int y=-1){
        if(x==-1&&y==-1){
            cnt=tim=0;

            for(int i=0;i<26;i++){
                int sub=0,n=v[i].size();

                for(int j=0;j<n;j++){
                    auto [T,f]=v[i][j];

                    if(f){
                        AC[i]=1;
                        tot[i]=T+sub*20;
                        break;
                    }

                    sub++;
                }

                cnt-=AC[i];
                tim+=tot[i];
            }
        }else{
            reset();

            cnt+=AC[x];
            tim-=tot[x];

            int sub=0,n=v[x].size();
            for(int j=0;j<n;j++){
                auto [T,f]=v[x][j];

                if(y==j)f^=1;

                if(f){
                    cnt--;
                    tim+=T+sub*20;
                    break;
                }

                sub++;
            }
        }
    }

    inline bool empty()const{
        for(int i=0;i<26;i++){
            if(v[i].size()||ac[i]||wa[i])return false;
        }

        return (cnt==0)&&(tim==0);
    }

    inline bool legal()const{
        return cnt<0;
    }
};

int m;

string s;
char ch;
int id,op,tim,flag;

inline void solve(){
    cin>>m;

    int cnt=0;
    map<string,int>mp;
    vector<string>name(1);

    vector<team>a(1);
    vector<array<int,4> >v(m);

    for(int i=0;i<m;i++){
        cin>>s>>ch>>tim;

        if(mp.find(s)==mp.end()){
            mp[s]=++cnt;
            a.push_back({});

            assert(a[cnt].empty());

            name.push_back(s);
        }

        id=mp[s],op=ch-'A';

        cin>>s;

        auto [pos,useful]=a[id].insert(op,tim,(s[0]=='a'?1:0));

        v[i]={id,op,pos,useful};
    }

    for(int i=1;i<=cnt;i++){
        a[i].cal();
        a[i].init_cnt=a[i].cnt,a[i].init_tim=a[i].tim;
    }

    int sol=0;
    multiset<array<int,3> >s;

    auto del=[&](int i)->void {
        s.extract({a[i].cnt,a[i].tim,i});
        if(a[i].legal())sol--;
    };

    auto add=[&](int i)->void {
        s.insert({a[i].cnt,a[i].tim,i});
        if(a[i].legal())sol++;
    };

    for(int i=1;i<=cnt;i++)add(i);

    vector<int>ans(cnt+1);

    int nowteam=0;
    vector<int>con(cnt+1);
    auto check=[&]()->void {
        int line=min((sol+9)/10,35);
        if(!line)return;

        auto it=s.begin();
        for(int i=0;i<line;i++){
            ans[(*it)[2]]=1;
            it++;
        }

        if(nowteam){
            auto [cnt,tim,_]=*prev(it);
            if(a[nowteam].cnt<cnt||(a[nowteam].cnt==cnt&&a[nowteam].tim<=tim))ans[nowteam]=1;
        }

        while(it!=s.end()&&(*prev(it))[0]==(*it)[0]&&(*prev(it))[1]==(*it)[1]){
            if(con[(*it)[2]]++)break;

            ans[(*it)[2]]=1;
            it++;
        }
    };

    check();

    for(const auto &[i,op,j,useful]:v){
        //* 如果是 [ac/wa 的第一发] 或者是 [wa 的最后一发且前面没有 ac]
        if(useful||(j==a[i].v[op].size()-1&&a[i].v[op].back().second==0&&a[i].ac[op]==0)){
            nowteam=i;

            del(i);
            a[i].cal(op,j);
            add(i);
            
            check();
            
            del(i);
            a[i].reset();
            add(i);
        }
    }

    cout<<accumulate(ans.begin(),ans.end(),0)<<"\n";

    for(int i=1;i<=cnt;i++){
        if(ans[i])cout<<name[i]<<" ";
    }

    cout<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t=1;
    cin>>t;
    while(t--)solve();

    return 0;
}