Problem: This is an interactive problem.

You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.

More formally, there is a singly liked list built on an array of n elements. Element with index i contains two integers: valuei is the integer value in this element, and nexti that is the index of the next element of the singly linked list (or -1, if the current element is the last). The list is sorted, i.e. if nexti ≠ - 1, then valuenexti > valuei.

You are given the number of elements in the list n, the index of the first element start, and the integer x.

You can make up to 2000 queries of the following two types:

  * ? i (1 ≤ i ≤ n) — ask the values valuei and nexti, 
  * ! ans — give the answer for the problem: the minimum integer, greater than or equal to x, or ! -1, if there are no such integers. Your program should terminate after this query. 



Write a program that solves this problem.

Input

The first line contains three integers n, start, x (1 ≤ n ≤ 50000, 1 ≤ start ≤ n, 0 ≤ x ≤ 109) — the number of elements in the list, the index of the first element and the integer x.

Output

To print the answer for the problem, print ! ans, where ans is the minimum integer in the list greater than or equal to x, or -1, if there is no such integer.

Interaction

To make a query of the first type, print ? i (1 ≤ i ≤ n), where i is the index of element you want to know information about.

After each query of type ? read two integers valuei and nexti (0 ≤ valuei ≤ 109,  - 1 ≤ nexti ≤ n, nexti ≠ 0).

It is guaranteed that if nexti ≠ - 1, then valuenexti > valuei, and that the array values give a valid singly linked list with start being the first element.

Note that you can't ask more than 1999 queries of the type ?.

If nexti = - 1 and valuei = - 1, then it means that you asked more queries than allowed, or asked an invalid query. Your program should immediately terminate (for example, by calling exit(0)). You will receive "Wrong Answer", it means that you asked more queries than allowed, or asked an invalid query. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.

Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including the final answer.

To flush you can use (just after printing a query and line end):

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



Hacks format

For hacks, use the following format:

In the first line print three integers n, start, x (1 ≤ n ≤ 50000, 1 ≤ start ≤ n, 0 ≤ x ≤ 109).

In the next n lines print the description of the elements of the list: in the i-th line print two integers valuei and nexti (0 ≤ valuei ≤ 109,  - 1 ≤ nexti ≤ n, nexti ≠ 0).

The printed structure should be a valid singly linked list. In particular, it should be possible to reach all elements from start by following links nexti, and the last element end should have -1 in the nextend.

Example

Input

5 3 80
97 -1
58 5
16 2
81 1
79 4


Output

? 1
? 2
? 3
? 4
? 5
! 81

Note

You can read more about singly linked list by the following link: <https://en.wikipedia.org/wiki/Linked_list#Singly_linked_list>

The illustration for the first sample case. Start and finish elements are marked dark. <image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 50010;
int n, id, x, val[N], nxt[N];
bool hit[N];
void found(int val) {
  cout << "! " << val << '\n';
  cout << flush;
  exit(0);
}
pair<int, int> ask(int pos) {
  cout << "? " << pos << '\n';
  cout << flush;
  pair<int, int> ret;
  cin >> ret.first >> ret.second;
  if (ret.first == -1 and ret.second == -1) found(-1);
  return ret;
}
long long rng() {
  long long r1 = rand(), r2 = rand(), r3 = rand();
  return abs(r1 * r2 * r3);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  srand(time(0));
  cin >> n >> id >> x;
  if (n < 2000) {
    int ans = -1;
    for (int i = 1; i <= n; i++) {
      int v = ask(i).first;
      if (v >= x) ans = (ans == -1 ? v : min(ans, v));
    }
    found(ans);
  }
  fill(hit, hit + N, 0);
  fill(nxt, nxt + N, -2);
  fill(val, val + N, -2);
  int piv = id;
  auto foo = ask(id);
  val[id] = foo.first;
  nxt[id] = foo.second;
  for (int ty = 1; ty < 1000; ty++) {
    int pos;
    do {
      pos = 1 + rng() % n;
    } while (hit[pos]);
    hit[pos] = 1;
    auto temp = ask(pos);
    val[pos] = temp.first;
    nxt[pos] = temp.second;
    if (val[pos] == x) found(x);
    if (val[pos] < x) {
      if (val[piv] < val[pos]) piv = pos;
    }
  }
  for (int ty = 0; ty < 999; ty++) {
    if (nxt[piv] == -2) {
      auto temp = ask(piv);
      val[piv] = temp.first;
      nxt[piv] = temp.second;
    }
    if (val[piv] >= x) found(val[piv]);
    piv = nxt[piv];
    if (piv == -1) found(-1);
  }
  found(-1);
  return 0;
}