/*

Author: Haze

2024/4/24

*/

#include <bits/stdc++.h>

#include <random>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll read() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;
ll n, H;
int query(ll i, ll h){
    if(h > H)return 0;
    cout << "? " << i << ' ' << h << endl;
    string S;
    cin >> S;
    if(S == "sky")return 0;
    return 1;
}
void solve() {

    cin >> n >> H;
    vector<ll>ord(n);
    irep(i, 0, n - 1){
        ord[i] = i + 1;
    }
    shuffle(ord.begin(), ord.end(), std::mt19937(std::random_device()()));
    ll tp = 0, ans = 0;
    irep(i, 0, n - 1){
        ll idx = ord[i];
        if(query(idx, ans + 1) == 0)continue;
        ll l = ans + 1, r = H;
        while(l < r){
            ll mid = (l + r + 1) >> 1;
            if(query(idx, mid))l = mid;
            else r = mid - 1;
        }
        ans = l, tp = idx;
    }
    if(tp == 0)tp = 1;
    cout << "! " << tp << ' ' << ans << endl;
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}