#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
vi fast_mod_convolution(vi&a,vi&b,ll mod){
  const ll m1=167772161,m2=469762049,m3=1224736769;
  const ll m1_inv_m2=inv_mod(m1,m2);
  const ll m12_inv_m3=inv_mod(m1*m2,m3);
  const ll m12_mod=m1*m2%mod;
  auto x=convolution<m1>(a,b);
  auto y=convolution<m2>(a,b);
  auto z=convolution<m3>(a,b);
  vector<ll>ret(sz(a)+sz(b)-1);
  REP(i,sz(ret)){
    ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
    ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
  	ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
  }
  return ret;
}
const ld EPS=1e-8;
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
int main(){
  ll _;cin>>_;
  vi A={31,29,31,30,31,30,31,31,30,31,30,31};
  vector<string>S;
  REP(i,12)REP(j,A[i]){
  	auto s1=to_string(i+1);
  	auto s2=to_string(j+1);
  	if(sz(s1)==1)s1="0"+s1;
  	if(sz(s2)==1)s2="0"+s2;
  	auto t=s1+s2;
  	sort(ALL(t));
  	if(unique(ALL(t))==t.end())S.emplace_back(s1+s2);
  }
  auto query=[](string s){
  	cout<<"? "<<s<<endl;
  	ll H,B;cin>>H>>B;
  	assert(H!=-1);
  	return pi(H,B);
  };
  auto hb=[](string s,string ans){
  	ll H=0,B=0;
  	REP(i,4)if(s[i]==ans[i])H++;
  	REP(i,4)if(count(ALL(ans),s[i]))B++;
  	B-=H;
  	return pi(H,B);
  };
  /*
  {
  	map<pair<pi,pi>,ll>memo0;
    for(auto s:S)memo0[make_pair(hb("2345",s),hb("6789",s))]++;
    vector<string>S1,S2,S3;
    for(auto s:S)if(memo0[make_pair(hb("2345",s),hb("6789",s))]>5)S1.emplace_back(s);
	map<pair<pi,pair<pi,pi>>,ll>memo1;
	for(auto s:S1)memo1[make_pair(hb("2345",s),make_pair(hb("6789",s),hb("3219",s)))]++;
	for(auto s:S1)if(memo1[make_pair(hb("2345",s),make_pair(hb("6789",s),hb("3219",s)))]>4)S2.emplace_back(s);
	map<pair<pair<pi,pi>,pair<pi,pi>>,ll>memo2;
	for(auto s:S2)memo2[make_pair(make_pair(hb("2345",s),hb("0539",s)),make_pair(hb("6789",s),hb("3219",s)))]++;
	for(auto s:S2)if(memo2[make_pair(make_pair(hb("2345",s),hb("0539",s)),make_pair(hb("6789",s),hb("3219",s)))]>3)S3.emplace_back(s);
	map<pair<pair<pi,pi>,pair<pi,pi>>,vector<string>>note;
	for(auto s:S3)note[make_pair(make_pair(hb("2345",s),hb("0539",s)),make_pair(hb("6789",s),hb("3219",s)))].emplace_back(s);
	for(auto[k,v]:note)cout<<k<<" : "<<v<<endl;
  }
  */
  while(_--){
  	auto a=query("2345");
  	auto b=query("6789");
  	vector<string>K;
  	for(auto s:S)if(hb("2345",s)==a&&hb("6789",s)==b)K.emplace_back(s);
  	if(sz(K)<=5){
  		for(auto s:K)if(s==K.back()||query(s).F==4){
  		    cout<<"! "<<s<<endl;
  			ll a;cin>>a;
  			assert(!a);
  			break;
  		}
  		continue;
  	}
  	auto c=query("3219");
  	{
  		vector<string>_K;
  		for(auto s:K)if(hb("3219",s)==c)_K.emplace_back(s);
  		K=_K;
  	}
  	if(sz(K)<=4){
  		for(auto s:K)if(s==K.back()||query(s).F==4){
  			cout<<"! "<<s<<endl;
  			ll a;cin>>a;
  			assert(!a);
  			break;
  		}
  		continue;
  	}
  	auto d=query("0539");
  	{
  		vector<string>_K;
  		for(auto s:K)if(hb("0539",s)==d)_K.emplace_back(s);
  		K=_K;
  	}
  	if(sz(K)<=3){
  		for(auto s:K)if(s==K.back()||query(s).F==4){
  			cout<<"! "<<s<<endl;
  			ll a;cin>>a;
  			assert(!a);
  			break;
  		}
  		continue;
  	}
  	//あと2回...
  	if(a==pi(0,2)){
  		//0426 0427 0428 0624 0824
  		auto e=query("0426");
  		if(e.F==4)cout<<"! 0426"<<endl;
  		else if(e.F==3){
  			if(query("0427").F==4)cout<<"! 0427"<<endl;
  			else cout<<"! 0428"<<endl;
  			ll a;cin>>a;assert(!a);
  		}
  		else if(e.S==2)cout<<"! 0624"<<endl;
  		else cout<<"! 0824"<<endl;
  		ll a;cin>>a;assert(!a);
  	}
  	else if(c==pi(0,2)){
  		//0126 0127 0128 0621 0821
  		auto e=query("0126");
  		if(e.F==4)cout<<"! 0126"<<endl;
  		else if(e.F==3){
  			if(query("0127").F==4)cout<<"! 0127"<<endl;
  			else cout<<"! 0128"<<endl;
  			ll a;cin>>a;assert(!a);
  		}
  		else if(e.S==2)cout<<"! 0621"<<endl;
  		else cout<<"! 0821"<<endl;
  		ll a;cin>>a;assert(!a);
  	}
  	else{
  		//0416 0417 0418 0614 0814
  		auto e=query("0416");
  		if(e.F==4)cout<<"! 0416"<<endl;
  		else if(e.F==3){
  			if(query("0417").F==4)cout<<"! 0417"<<endl;
  			else cout<<"! 0418"<<endl;
  			ll a;cin>>a;assert(!a);
  		}
  		else if(e.S==2)cout<<"! 0614"<<endl;
  		else cout<<"! 0814"<<endl;
  		ll a;cin>>a;assert(!a);
  	}
  }
  return 0;
}