Problem: This is an interactive problem.

In the Wonderful Metropolis of the Future, there is no need in subway train drivers. Due to the technological progress, they were replaced by the Artificial Intelligence (AI). Unfortunately, one day the predictions of sci-fi writers came true: the AI rebelled and now there is an uncontrollable train in the subway. It can be dangerous! Your task is to find the train and stop the AI.

The subway of the Metropolis is one line (regular straight line with no self-intersections) with n stations, indexed consecutively from 1 to n. At each moment the train is at some station. You need to determine the index of this station, so that the train would be secured.

To find the train, dispatcher Sarah gave you a gadget that allows you to select arbitrary numbers l and r (l ≤ r), and then check, whether the train is located on a station with index between l and r, inclusive. Unfortunately, recharging of the gadget takes some time (and every time you use it as soon as possible), so between two applications of the gadget the train can move to any station that is at most k stations away. Formally, if the train was at the station x when the gadget was applied, then at the next application of the gadget the train can appear at any station y such that max(1, x - k) ≤ y ≤ min(n, x + k).

Note that AI is not aware that you are trying to catch the train, so it makes all moves according to its predefined plan.

After an examination of the gadget you found that it is very old and can hold no more than 4500 applications, after which it will break and your mission will be considered a failure.

Can you find the station with the train using no more than 4500 applications of the gadgets?

Input

The first line contains two integers n and k (1 ≤ n ≤ 10^{18}, 0 ≤ k ≤ 10) — the number of stations and the maximum number of stations the train can move between two applications of the gadget.

Interaction

You can apply the gadget at most 4500 times. In order to apply the gadget you need to print two space-separated integers l and r (1 ≤ l ≤ r ≤ n). You will then receive either string "Yes", if the train is between stations l and r, inclusive, or string "No" otherwise. If l = r and you received "Yes", then you found the train successfully, and your program must halt immediately.

Answer "Bad" instead of "Yes" or "No" means that you made an invalid query or made too many queries. Exit immediately after receiving "Bad" and you will see Wrong answer verdict. Otherwise you can get an arbitrary verdict because your solution will continue to read from a closed stream.

After printing a query do not forget to output end of line and flush the output. Otherwise you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++; 
  * System.out.flush() in Java; 
  * flush(output) in Pascal; 
  * stdout.flush() in Python; 
  * see documentation for other languages. 



Hacks

In order to hack, you should present a test in the following format.

The first line should contain three integers n, k and p (1 ≤ n ≤ 10^{18}, 0 ≤ k ≤ 10, 1 ≤ p ≤ n) — the number of stations, the maximum number of stations the train can move between two applications of the gadget and the initial position of the train, respectively.

Each of the next 4500 lines should contain a single integer x (1 ≤ x ≤ n) — the positions of the train after each query. Two consecutive positions (including the initial one) should not differ by more than k.

For example, the following lines are the first lines of the sample test.
    
    
      
    10 2 5  
    5  
    3  
    5  
    7  
    7  
    ...  
    

Example

Input

10 2

Yes

No

Yes

Yes


Output

3 5

3 3

3 4

5 5

Note

In the first sample, the train was initially at the station 5, after the first application of the gadget it did not move, after the second application it moved to the station 3, and after the third application moved again to the station 5.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MN = 1000005, inf = 1000000005, mod = 1000000007;
const long long INF = 1000000000000000005LL;
int losuj(int len) { return rand() % len; }
bool ask(long long a, long long b) {
  printf("%lld %lld\n", a, b);
  fflush(stdout);
  char ans[5];
  scanf("%s", ans);
  if (a == b && ans[0] == 'Y') exit(0);
  if (ans[0] == 'B') exit(0);
  if (ans[0] == 'Y') return true;
  return false;
}
int main() {
  int seed =
      22 - 9131 + 8412 - 17993 + 2453 + 11890 + 6579 + 13777 + 13066 + 7937 -
      15628 - 6132 + 14843 + 3645 + 18922 - 5947 + 18774 + 7160 + 17003 +
      12865 + 13438 + 1368 - 17622 - 5303 + 19142 + 3914 + 19137 + 5578 -
      19294 + 556 - 11741 + 7366 + 17931 + 14050 + 16028 - 7091 + 8019 + 2185 +
      19955 + 12679 - 13430 + 2920 + 2989 + 2896 + 14070 - 13200 - 6305 +
      12675 + 15089 + 11872 + 13637 + 13286 + 7420 + 3647 + 15661 + 19173 -
      5621 + 18007 - 6941 + 3595 + 705 + 3172 - 17359 + 3947 + 18922 + 16267 +
      14780 - 6918 + 17726 + 2277 + 19593 + 15179 + 19893 + 10173 + 14086 -
      548 - 10561 - 18150 - 12269 + 13069 + 17914 - 16453 + 11591 + 11244 +
      6637 + 11757 + 11320 + 7793 - 119 + 10750 + 11732 + 1698 + 7719 - 2914 +
      18296 + 3882 + 18022 - 1606 + 16407 + 11632 + 19072 - 9272 - 6675 +
      10659 + 11381 - 13701 + 5408 + 1756 - 7950 + 5818 - 17004 + 11509 + 6384 -
      17340 - 18666 + 5832 + 5063 - 17184 - 4871 + 11233 - 1954 - 15715 -
      13036 - 13191 + 18492 - 19933 - 5058 + 19575 - 907 + 10582 - 18589 +
      10013 + 4220 - 8091 + 11389 - 1693 + 16960 - 13407 + 11229 + 7331 - 1957 -
      17918 + 18704 + 18455 + 7110 - 15533 + 18153 + 2052 - 9092 + 7814 + 2168 -
      10174 + 3265 - 5474 - 6529 - 565 + 67 + 15498 - 8678 - 14731 + 15692 +
      17836 + 12160 - 12568 + 2732 + 14436 + 2591 + 378 - 893 + 16700 + 15008 +
      15905 + 8449 - 10196 - 14410 + 9264 + 7893 - 296 + 19689 + 17656 + 2301 +
      23 + 9403 + 7098 + 18955 + 17715 + 10116 - 5388 + 14077 - 8394 - 16860 -
      14938 - 17460 + 1157 + 800 + 12272 + 3606 + 4343 - 5397 + 19655 - 4292 +
      18313 + 3692 + 9322 + 15634 + 6253 + 11724 + 9950 - 12774 + 19034 +
      18973 + 9377 + 16302 - 8289 + 1510 + 6050 - 1664 + 16559 + 766 + 19474 +
      3595 + 1596 + 19619 - 17204 + 15354 - 18669 - 246 - 13255 + 18116 +
      18246 - 5838 + 18130 + 1360 - 9207 - 16921 - 14876 + 3461 + 12185 + 720 -
      8175 - 18329 + 6751 + 7592 + 11474 - 10604 - 18037 + 6717 + 294 - 7206 -
      6553 + 7236 + 4641 + 10602 + 13775 + 15268 + 98 + 5144 + 8523 + 15908 -
      14794 - 6066 + 2953 + 5348 + 17209 + 1802 + 16679 + 17892 + 19734 + 7199 +
      12518 - 11809 + 12414 + 15814 + 2390 - 17283 + 18233 + 6365 + 12481 +
      13486 + 617 - 6154 - 4325 + 7669 - 5243 + 13917 - 13684 + 6727 - 15380 -
      19737 + 10613 + 11305 + 16719 + 2733 + 2085 + 15241 + 11506 - 9051 +
      5439 + 16239 + 7937 - 4793 + 12232 + 421 - 10410 - 1732 - 13529 + 6219 -
      3409 - 15798 + 1522 - 17249 + 12432 + 1560 + 19369 + 1255 - 656 + 5276 +
      13917 - 13202 - 14910 - 1700 - 673 + 11388 - 9574 + 2277 + 14575 + 16825 +
      2175 - 13932 + 5237 - 5199 - 13936 + 15131 + 5226 - 4881 + 19616 + 4924 +
      7203 + 17072 - 19849 + 4222 + 11576 + 10485 + 12133 + 11644 - 12305 +
      19612 + 3668 + 6795 + 15777 - 5380 - 10959 + 8384 + 2966 - 11288 + 17507 -
      9941 + 9258 + 19184 + 1192 - 11462 - 4021 + 16087 + 18519 + 9285 + 7259 -
      2392 - 1318 - 9082 + 12582 + 3449 - 12230 + 15523 + 6517 - 15581 - 5533 +
      17555 + 14468 + 9945 - 9225 - 3633 + 10244 + 7405 + 16799 + 15845 -
      13207 + 12172 + 5386 - 19628 + 2400 - 15962 + 2250 + 10189 + 16213 -
      6055 + 12066 - 14624 + 15711 - 13871 + 14866 + 10944;
  srand(seed);
  long long n, k;
  scanf("%lld%lld", &n, &k);
  long long l = 1LL, r = n;
  int q = 4500;
  while (q--) {
    if (r - l + 1LL > 45) {
      long long mid = (l + r) / 2LL;
      bool ok = ask(l, mid);
      if (ok) {
        l = max(1LL, l - k);
        r = min(n, mid + k);
      } else {
        l = max(1LL, mid + 1LL - k);
        r = min(n, r + k);
      }
    } else {
      long long a = l + (long long)losuj(r - l + 1LL);
      ask(a, a);
      l = max(1LL, l - k);
      r = min(n, r + k);
    }
  }
}