#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}


void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    auto f = [&](string a, string b) -> pair<int, int> {
        pair<int, int> res = {0, 0};
        rep(i, 0, 4) rep(j, 0, 4){
            if (a[i] == b[j]){
                if (i == j) res.first++;
                else res.second++;
            }
        }
        return res;
    };
    vector<string> p;
    vector<int> days = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    rep(i, 0, 12){
        string mo = "00";
        mo[1] = (char)('0' + (1 + i) % 10);
        if (i >= 9){
            mo[0] = '1';
        }
        rep(j, 1, days[i] + 1){
            string tmp = mo;
            tmp += (char)('0' + j / 10);
            tmp += (char)('0' + j % 10);
            p.push_back(tmp);
        }
    }
    rep(rp, 0, 6){
        string call = "0123";
        int sc = INF;
        rep(i, 0, 10000){
            string X;
            int tmp = i;
            rep(k, 0, 4){
                X += (char)('0' + tmp % 10);
                tmp /= 10;
            }
            bool ok = 1;
            rep(j, 0, 4) rep(k, j + 1, 4){
                if (X[j] == X[k]) ok = 0;
            }
            if (!ok) continue;
            vector G(5, vector<int>(5));
            for (auto x : p){
                auto a = f(x, X);
                G[a.first][a.second]++;
            }
            if (!ok) continue;
            int n_s = 0;
            rep(k, 0, 5) chmax(n_s, vec_max(G[k]));
            if (chmin(sc, n_s)) call = X;
        }
        cout << "? " << call << endl;
        pair<int, int> a;
        cin >> a.first >> a.second;
        vector<string> n_p;
        for (auto x : p){
            if (f(x, call) == a) n_p.push_back(x);
        }
        swap(n_p, p);
        if ((int)p.size() == 1) break;
    }
    cout << "! " << p[0] << endl;
    int ans;
    cin >> ans;
    assert(ans == 0);
}