#ifdef DEBUG_IS_VALID
#define DEB 1 
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif

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

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#pragma GCC optimize ("-O3")

using namespace std;

#define DUMPOUT cout
#define dump(...) if(DEB) DUMPOUT<<"  "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<"    "; if(DEB) dump_func(__VA_ARGS__)
template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;}
template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; }
template<typename T>ostream& operator << (ostream& os, set<T>& st){cout << "{"; for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;}
template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; }

void dump_func(){DUMPOUT << endl;}
template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);}
template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;}
template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<Pl>;
using vvp = vector<vp>;

const int INF = 1<<29;
const long long LINF=1LL<<59;

class ParseExpression{
  public:
  using Result = pair<int,int>; // value, index
  int idx, val;
  ParseExpression(const string& s){
    // expression := factor{+factor}*
    // factor     := term{*term}*
    // term       := (expression)|Number
    tie(val,idx) = expression(s);
  }
  int op(char optr,int lhs,int rhs){
    if(optr=='+') return lhs+rhs;
    if(optr=='-') return lhs-rhs;
    if(optr=='*') return lhs*rhs;
    if(optr=='/') return lhs/rhs;
    return -1; // undefined
  }
  Result expression(const string& s,int p=0){
    Result res = factor(s,p);
    p = res.second;
    while(p<s.size() && (s[p] == '+' || s[p] == '-')){
      Result right = factor(s,p+1);
      res.first = op(s[p],res.first,right.first);
      p = right.second;
    }
    res.second = p;
    return res;
  }
  Result factor(const string& s,int p=0){
    Result res = term(s,p);
    p = res.second;
    while(p<s.size() && (s[p] == '*' || s[p] == '/')){
      Result right = term(s,p+1);
      res.first = op(s[p],res.first,right.first);
      p = right.second;
    }
    res.second = p;
    return res;
  }
  Result term(const string& s,int p=0){
    if(s[p]=='('){
      Result res = expression(s,p+1);
      res.second++; // skip '('
      return res;
    }else{
      int val = 0;
      while(isdigit(s[p])) val = val * 10 + (s[p++]-'0');
      return Result(val, p);
    }
  }
};

int main(){
  int Q; cin >> Q ;
  rep(i,Q){
    string s;
    cin >> s;
    cout << ParseExpression(s).val << endl;
  }
  return 0;
}



Measured memory_bytes: 3096