WA on test case2求调

#include <bits/stdc++.h>
#define lint long long
using namespace std;
lint T;
lint n, m;
lint ll[31], lr[31];
void init()
{
    for (m = 1; lr[m - 1] < n; ++m) ll[m] = lr[m - 1] + 1, lr[m] = ll[m] * 4;
    --m;
}
int main()
{
    cin >> T;
    while (T--)
    {
        cin >> n;
        init();
        lint l = 1, r = m;
        while (l < r)
        {
            lint mid = (l + r) >> 1;
            cout << "? " << min(n, lr[mid]) << endl;
            cout.flush();
            lint res;
            cin >> res;
            if (res == 0) r = mid;
            else l = mid + 1;
        }
        cout << "! " << min(n, ll[l] * 2) << endl;
        cout.flush();
    }
    return 0;
}