CF1039B Subway Pursuit

### 题目大意： 交互题 在$1$到$n$里有一个运动的点，要求找到这个点，每次可以查询一个区间内有没有这个点，每次这个点往左或者往右移动$1$到$k$个位置，要求要在$4500$次查询内找到这个点的位置

无

无

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 $ .