// translated from python because 2e5 flush is too slow >:(

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

const bool TEST = false;

using i128 = __int128_t;
using ll = long long;

i128 inv(i128 a, i128 m){
	a %= m;
	if (a == 1){
		return 1;
	}
	return m - (inv(m, a) * m / a);
}


const int NP = 3;
const vector<i128> primes = {2000000011, 2000000033, 2000000063};
i128 prod;
vector<i128> mults;

void init(){
	prod = 1;
	for(i128 a : primes) prod *= a;
	for(i128 a : primes){
		mults.push_back((prod / a) * inv(prod / a, a) % prod);
	}
}

mt19937 mt(64);

void solve(){
	for(i128 p : primes){
		cout << "? " << (ll)(p) << '\n';
	}
	cout << flush;
	i128 P, Q;
	vector<i128> x;
	if(TEST){
		P = mt() % (int(1e9) + 1);
		Q = (mt() % int(1e9)) + 1;
		for(i128 a : primes){
			x.push_back((P * inv(Q, a)) % a);
		}
	} else {
		for(int i = 0; i < NP; i++){
			ll r;
			cin >> r;
			x.push_back(r);
		}
	}
	i128 y = 0;
	for(int i = 0; i < NP; i++){
		y += x[i] * mults[i];
		y %= prod;
	}
	i128 ln = 0;
	i128 ld = 1;
	i128 rn = 1;
	i128 rd = 1;
	while(true){
		i128 mn = ln + rn;
		i128 md = ld + rd;
		i128 b = 0;
		if (mn * prod < md * y){
			while ((ld + (rd << b)) < int(2e9) and (ln + (rn << b)) * prod < (ld + (rd << b)) * y){
				b += 1;
			}
			ln += (rn << (b-1));
			ld += (rd << (b-1));
		} else {
			while (((ld << b) + rd) < int(2e9) and ((ln << b) + rn) * prod > ((ld << b) + rd) * y){
				b += 1;
			}
			rn += (ln << (b-1));
			rd += (ld << (b-1));
		}
		if (ld > int(1e9) or rd > int(1e9)){
			break;
		}
	}
	i128 q = min(ld, rd);
	i128 p = (q * x[0]) % primes[0];
	cout << "! " << ll(p) << " " << ll(q) << '\n';
	if (TEST) {
		assert(p * Q == P * q);
	}
}

int main(){
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	init();
	int T;
	cin >> T;
	while(T--) solve();
}