#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h> 

char operation[5]={'+','-','*','/','^'};
char OpList[5][5]={
				{'=','=','<','<','<'},
				{'=','=','<','<','<'},
				{'>','>','=','=','<'},
				{'>','>','=','=','<'},
				{'>','>','>','>','>'},	
};//优先级表 
int topn=0,topo=0;
char numstack[100];//数字栈
char opstack[100];//符号栈 
char expression[200];//表达式数组 

void push_num(char q)//数字入栈 
{	
	numstack[topn]=q;
	topn++;
}

char pop_num()//数字出栈 
{
	return numstack[topn--];
}

void push_op(char ch)//操作符入栈 
{	
	topo++;
	opstack[topo]=ch;
}

char pop_op()//操作符出栈 
{
	return opstack[topo--];
}

char compare(char x,char y)//比较x，y的优先级 
{
	int a,b;
	for(int i=0;i<=8;i++)
	{
		if(operation[i]==x) 
		{
			a=i;
			break;
		}
	}
	for(int i=0;i<=8;i++)
	{
		if(operation[i]==y) 
		{
			b=i;
			break;
		}
	}
	return OpList[a][b];
}

int main()
{
	int N;
	scanf("%d",&N);
	char *p;
	while(N--)
	{
		int length=0;
		char op;
		topo=0;
		topn=0;
		scanf("%s",expression);
		p=expression;
		while(*p!='#')
		{
			if((*p>='A'&&*p<='Z')||(*p>='a'&&*p<='z'))//操作数入栈 
			{
				push_num(*p);
				length++;	
			}
			else if(*p=='+'||*p=='-'||*p=='*'||*p=='/'||*p=='^') 
			{
				while(1)
				{
					if(topo==0||opstack[topo]=='(')//栈空或栈顶为（ 
					{
						push_op(*p);
						length++;
						break;
					}	
					else if(compare(*p,opstack[topo])=='>')//优先级比栈顶元素高 
					{
						push_op(*p);
						length++;
						break;
					}
					else if((compare(*p,opstack[topo])=='<')||(compare(*p,opstack[topo])=='='))//优先级比栈顶元素低 
					{
						op=pop_op();
						push_num(op);
					}
				}	
			}
			else if(*p=='(')	push_op(*p);
			else if(*p==')')
			{
				while(opstack[topo]!='(')
				{
					op=pop_op();
					push_num(op);
				}
				if(opstack[topo]=='(')//丢弃（ 
				{
					op=pop_op();
				}
			}
			p++;		
		}//从左向右扫描完毕
		topn--;
		while(topn>=0)
		{
			op=pop_num();
			push_op(op);
		} 
		while(topo>0)
		{
			printf("%c",opstack[topo]);
			topo--;
		}
		printf("\n");
	}
	return 0;
}