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