#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<map>
#include<stdio.h>
using namespace std;void decode(int a) {vector<char> result;while(a) { result.push_back(a%27+'a'-1); a/=27; }       //%27+1for(int i = result.size() - 1; i >= 0; i --) {cout<<result[i];}
}struct Tree {int rcode, lch, rch;        //code of root. treeid of left and right sub-tree.
    Tree(){}Tree(int a, int b, int c):rcode(a), lch(b), rch(c) { }bool operator < (const Tree& rhs) const {if(rcode == rhs.rcode){if(lch == rhs.lch) return rch < rhs.rch;return lch < rhs.lch;}return rcode < rhs.rcode;}
};//Global Variables. Reset upon Each Case!
const int maxn = 50000+5;
int T, treecnt, vis[maxn], ans[maxn], cnt;
char str[5*(maxn+10000)], *p;
Tree trees[maxn];
map<Tree, int> tree_map;
/////int getTreeID(Tree& t)
{if(tree_map.count(t)) return tree_map[t];else{Tree& v = trees[treecnt];v = t;return tree_map[t] = treecnt++;}
}int parse()
{int lch = -1, rch = -1;int name = 0;while(isalpha(*p)) {name = name*27 + (*p-'a'+1);p ++;}if(*p == '(') {p++;lch = parse();p ++;rch = parse();p ++;}Tree tmp = Tree(name, lch, rch);return getTreeID(tmp);
}void print_ans(int id)
{if(ans[id] != -1) cout<<ans[id];else {ans[id] = ++cnt;decode(trees[id].rcode);if(trees[id].lch != -1){cout<<"(";print_ans(trees[id].lch);cout<<",";print_ans(trees[id].rch);cout<<")";}}
}int main()
{memset(vis, -1, sizeof(vis));cin>>T;while(T--){treecnt = cnt = 0;tree_map.clear();scanf("%s", str);p = str;memset(ans, -1, sizeof(ans));print_ans(parse());printf("\n");}return 0;
}