#include #include int n, k, minsteps, x; int GetForTwo(int i, int j) { int t = 1, t2 = j - i; while (t < t2) { t2 -= t; t++; } return t; } int GetSteps(int i, int j, int e) { int t; if ((e == 1) || (i == j)) { x = i; return j - i; } if (e == 2) { t = GetForTwo(i, j); x = i + t - 1; return t; } x = (i + j) / 2; return 1000; } int main() { char c[10] = ""; int i, j, t; scanf("%d%d", &n, &k); i = 1; j = n; gets(c); while (c[0] != 'e') { if (c[0] == 's') i = x + 1; if (c[0] == 'b') { j = x; k--; } minsteps = 1000; t = GetSteps(i, j, k); if (t == 0) printf("answer %d\n", x); else printf("query %d\n", x); fflush(stdout); gets(c); } return 0; }