I

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

// - - - - - - Data Types - - - - - - //

typedef long int LI;
typedef long long LL;

// - - - - - - Vectors - - - - - - //
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<string> VS;
typedef vector<double> VD;
typedef vector<VI> VVI;

#define scanVI(v, n)        for(int i=0; i<n; i++){ int x; cin >> x; v.PB(x); }
#define scanVLLI(v, n)      for(int i=0; i<n; i++){ LLI x; cin >> x; v.PB(x); }
#define scanVS(v, n)        for(int i=0; i<n; i++){ string x; cin >> x; v.PB(x); }
#define scanVD(v, n)        for(int i=0; i<n; i++){ double x; cin >> x; v.PB(x); }

// - - - - - - Maps - - - - - - //
typedef map<int, int> MII;
typedef map<int, string> MIS;
typedef map<int, char> MIC;
typedef map<string, int> MSI;
typedef map<char, int> MCI;
typedef map<int, VI> MIVI;

// - - - - - - Pairs - - - - - - //
typedef pair<int, int> PII;
typedef pair<string, string> PSS;
typedef pair<char, char> PCC;
typedef pair<int, string> PIS;
typedef pair<int, char> PIC;
typedef pair<string, char> PSC;

// - - - - - - Sets - - - - - - //
typedef set<int> SI;
typedef set<LL> SLL;
typedef set<string> SS;
typedef set<char> SC;
// - - - - - - - - - - - - - - - - - - //

#define PF                  printf
#define SF                  scanf
#define PB                  push_back
#define POP                 pop_back()
#define PP                  prev_permutation
#define NP                  next_permutation
#define MP                  make_pair
#define CLRN(a, b)          memset(a, b, sizeof(a))
#define CLR(a)              memset(a, 0, sizeof(a))
#define ALL(a)              a.begin(), a.end()
#define ALLN(a, n)          (a, a+n)
#define BSRCN(a, n, x)      binary_search(ALLN(a, n), x)
#define BSRC                binary_search
#define MAX                 10000007
#define MIN                 -10000007
#define PI                  acos(-1)
#define BR                  PF("\n")
#define FastIO              ios_base::sync_with_stdio(false)
#define READ()              freopen("input.txt", "r", stdin)
#define WRITE()             freopen("output.txt", "w", stdout)
#define len(a)              a.length()
#define rsort(a)            sort(a.rbegin(), a.rend())
#define pvec(v)             for(auto x: v) cout<<x<<" "

// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - //
/*----------------------Graph Moves----------------*/
int ROW[]={+1,-1,+0,+0};
int COL[]={+0,+0,+1,-1};

int X[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
int Y[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move

int KX[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
int KY[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

LL GCD(LL a, LL b) { return b == 0 ? a : GCD(b , a % b); }
int LCM(int a, int b) { return a * (b/GCD(a, b)); }
bool CMP(int a, int b) { return a>b; }

// - - - - - - - - - - - - - - - - - - - - - - - - - - - END - - - - - - - - - - - - - - - - - - - - - - - - - //


int main()
{
    // FastIO;
    #ifdef VAMP
     clock_t Start=clock();
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w", stdout);
    #endif

    int t;
    cin>>t;
    while (t--) {
        int n;
        cin>>n;
        string s;
        // getchar();
        map<string, string> mp;
        vector<string> v;
        // getchar();
        for (int i=0; i<=n; i++) {
            getline(cin, s);
            stringstream ss(s);
            string word, type, name, type1, type2, typed;
            int count=0;
            // cout<<"-->"<<i<<endl;
            while (ss>>word) {
                count++;
                if (count==6) word.pop_back();
                else if (count==2 and word[len(word)-1]==';')
                    word.pop_back();
                // cout<<count<<" "<<word<<endl;
                if (count==1) {
                    type=word;
                }
                if (count==2) {
                    // cout<<word<<endl;
                    // if (word[len(word)-1]==';') {
                    //     word.pop_back();
                    // }
                    name=word;
                    // mp[name]=type;
                    // cout<<"ok"<<" "<<name<<" "<<mp[name]<<endl;
                }

                if (type!="auto") {
                    // name.pop_back();
                    // cout<<name<<endl;
                    mp[name]=type;
                    break;
                }

                else {
                    if (count==4) {
                        type1=mp[word];
                        // cout<<word<<" "<<type1<<endl;
                    }
                    else if (count==6) {
                        word.pop_back();
                        type2=mp[word];
                        // cout<<type1<<" "<<type2<<endl;
                        if (type2=="double" or type1=="double") {
                            typed="double";
                        }
                        else if (type2=="float" or type1=="float") {
                            typed="float";
                        }
                        else if (type2=="int" and type1=="int") {
                            typed="int";
                        }
                        mp[name]=typed;
                        v.push_back(name);
                    }
                }

            }
            for (int j=0; j<v.size(); j++) {
                cout<<mp[v[j]]<<" "<<v[j]<<endl;
            }
            // cout<<endl;
        }
    }

    END:
    #ifdef VAMP
     fprintf(stderr, "\n>>Runtime: %.10fs\n", (double) (clock() - Start) / CLOCKS_PER_SEC);
    #endif
    return 0;
}