#include<algorithm> #include<bitset> #include<cmath> #include<cstdio> #include<cstdlib> #include<cstring> #include<ctime> #include<deque> #include<fstream> #include<iomanip> #include<iostream> #include<map> #include<queue> #include<set> #include<stack> #include<unordered_map> #include<unordered_set> #include<utility> #include<vector> using namespace std; #define dbg(x) (cout<<#x<<" = "<<(x)<<'\n') #ifdef HOME const string inputFile = "input.txt"; const string outputFile = "output.txt"; #else const string problemName = ""; const string inputFile = problemName + ".in"; const string outputFile = problemName + ".out"; #endif typedef long long int lld; typedef pair<int, int> PII; typedef pair<int, lld> PIL; typedef pair<lld, int> PLI; typedef pair<lld, lld> PLL; const int INF = (1LL << 31) - 1; const lld LINF = (1LL << 62) - 1; const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1}; const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1}; const int MOD = (int)(1e9) + 7; const int NMAX = 100000 + 5; const int MMAX = 100000 + 5; const int KMAX = 100000 + 5; const int PMAX = 100000 + 5; const int LMAX = 100000 + 5; const int VMAX = 100000 + 5; int main() { #ifndef HOME freopen(inputFile.c_str(), "r", stdin); freopen(outputFile.c_str(), "w", stdout); #endif int n, k, i, s; cin >> n >> k; //read the number of stories and eggs string response; if(k == 1) { for(i = 1; i <= n; i++) { cout << "query " << i << '\n'; cout.flush(); cin >> response; if(response == "broke") break; } cout << "answer " << i - 1 << '\n'; cout.flush(); } else { // stiu pentru k = 2 for(s = 0, i = 1; s + i <= n; i++) s += i; s = 0; for(; ; i--) { cout << "query " << s + i << '\n'; cout.flush(); cin >> response; if(response == "broke") break; s += i; } for(s++; ; s++) { cout << "query " << s << '\n'; cout.flush(); cin >> response; if(response == "broke") break; } cout << "answer " << s - 1 << '\n'; cout.flush(); } return 0; }