#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
const int MAXN = 1e3 + 6;
char s[MAXN];
int count(double n, double m, char ch) 
{
	double sum = 0.0;
	if (ch == '+')
		sum = n + m;
	if (ch == '-')
		sum = n - m;
	if (ch == '*')
		sum = n * m;
	if (ch == '/')
		sum = n / m;
	if (ch == '%')
		sum = (int)n % (int)m;
	return (int)sum;
}
int main()
{
	int n;
	s['%'] = s['/'] = s['*'] = 2, s['+'] = s['-'] = 1;
	while (cin >> n) 
	{
		getchar();
		while (n--) 
		{
			double a, c, e, ans = 0;
			char b, d;
			scanf("%lf", &a);
			getchar();
			scanf("%c", &b);
			getchar();
			scanf("%lf", &c);
			getchar();
			scanf("%c", &d);
			getchar();
			scanf("%lf", &e);
			getchar();
			//printf("%lf %c %lf %c %lf", a, b, c, d, e);
			if (s[b] >= s[d])
			{
				ans = count(a, c, b);
				//printf("ans1:%lf\n", ans);
				ans = count(ans, e, d);
				//printf("ans2:%lf\n", ans);
			}
			else 
			{
				ans = count(c, e, d);
				//printf("ans1:%lf\n", ans);
				ans = count(a, ans, b);
				//printf("ans2:%lf\n", ans);
			}
			printf("%d\n",(int)ans);
		}
	}
	return 0;
}