#include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int lv(char c){
	if(c=='+'||c=='-') return 1;
	else if(c=='*'||c=='/') return 2;
	else if(c=='(') return 0;
}
int Isoperator(string s){
	if(s=="*") return 3;
	if(s=="/") return 4;
	if(s=="+") return 1;
	if(s=="-") return 2;
	return 0;
}
string llToString(ll n){
	string res="";
	if(n==0){
		res="0";
		return res;
	}
	char s[4];
	int i=0,minus=0;
	if(n<0){
		minus=1;
		n=-n;
		res="-";
	}
	while(n){
		s[i]=n%10+'0';
		n/=10;
		i++;
	}
	for(int j=i-1;j>=0;j--){
		res+=(char)(s[j]);
	}
	return res;
}
ll StringToll(string s){
	ll res=0;
	for(int i=0;i<s.length();i++){
		res=res*10+s[i]-'0';
	}
	return res;
}
string dothePoland(string a,string b,int n){
	ll p1=StringToll(a),p2=StringToll(b);
	switch(n){
		case 1:return llToString(p1+p2);break;
		case 2:return llToString(p1-p2);break;
		case 3:return llToString(p1*p2);break;
		case 4:return llToString(p1/p2);break;
	}
}
void done(string s){
	int n=s.length();
	stack <char> st;
	vector <string> out;
	for(int i=0;i<n;i++){// dang ba lan
		if(s[i]>='0'&&s[i]<='9'){
			string t="";
			t+=(char)s[i];
			while(i<n-1&&s[i+1]<='9'&&s[i+1]>='0'){
				t+=(char)s[i+1];
				i++;
			}
			out.pb(t);
		}
		else if(s[i]=='(') st.push(s[i]);
		else if(s[i]!=')'){
			while(!st.empty()){
				if(lv(st.top())>=lv(s[i])){
					string t="";t+=(char)st.top();
					out.pb(t);
					st.pop();
				}
				else break;
			}
			st.push(s[i]);
		}
		else{
			while(st.top()!='('){
				string t="";t+=(char)st.top();
				out.pb(t);
				st.pop();
			}
			st.pop();
		}
	}
	while(!st.empty()){
		string t="";t+=(char)st.top();
		out.pb(t);
		st.pop();
	}
	for(int i=2;i<out.size();){//thuc hien tinh toan
		if(Isoperator(out[i])){
			out[i-2]=dothePoland(out[i-2],out[i-1],Isoperator(out[i]));
			out.erase(out.begin()+i-1,out.begin()+i+1);
			i--;
		}
		else i++;
	}
	cout<<out[0]<<endl;
}
int main(){
	ios_base::sync_with_stdio(false);
	int N;
	cin>>N;
	while(N--){
		string s;
		cin>>s;
		done(s);
	}
}