View Code of Problem 3938

#include <iostream>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <string>
#include <map>
#include <bitset>
#include <sstream>
 
using namespace std;
 
 
typedef long long ll;
const ll mod = 1e9 + 7;
 
ll R[1010] = {2, 3, 5, 7, 11, 13, 17, 19};
ll f[1010], g[1010];
 
 
void init() {
	for (int s = 1; s < (1 << 8); s++) {
		f[s] = 1, g[s] = 0;
		for (int j = 0; j < 8; j++)
			if ((s >> j) & 1) {
				f[s] = f[s] * R[j];
				g[s]++;
			}
	}
 
}
 
signed main() {
	int t;
	init();
	scanf("%d", &t);
	while(t--) {
		ll x, y, n, m;
		scanf("%lld%lld%lld%lld", &x, &y, &n, &m);
		int k = -1;
		while (k + 1 < 8 && R[k + 1] <= m) k++;
		k++;
		double cnt = 0;
		for(int i = 1; i < (1 << k); i++) {
			if(g[i] & 1) cnt += n / f[i];
			else cnt -= n / f[i];
		}
		printf("%s\n", n - cnt + min(1.0 * y, cnt) >= 1.0 * x ? "(*^_^*)" : "(ToT)");
	}
	return 0;
}