Problem: This is an interactive task.

Scientists are about to invent a new optimization for the Floyd-Warshall algorithm, which will allow it to work in linear time. There is only one part of the optimization still unfinished.

It is well known that the Floyd-Warshall algorithm takes a graph with n nodes and exactly one edge between each pair of nodes. The scientists have this graph, what is more, they have directed each edge in one of the two possible directions.

To optimize the algorithm, exactly m edges are colored in pink color and all the rest are colored in green. You know the direction of all m pink edges, but the direction of green edges is unknown to you. In one query you can ask the scientists about the direction of exactly one green edge, however, you can perform at most 2 ⋅ n such queries.

Your task is to find the node from which every other node can be reached by a path consisting of edges of same color. Be aware that the scientists may have lied that they had fixed the direction of all edges beforehand, so their answers may depend on your queries.

Input

The first line contains two integers n and m (1 ≤ n ≤ 100 000, 0 ≤ m ≤ 100 000) — the number of nodes and the number of pink edges.

The next m lines describe the pink edges, the i-th of these lines contains two integers u_i, v_i (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i) — the start and the end of the i-th pink edge. It is guaranteed, that all unordered pairs (u_i, v_i) are distinct.

Output

When you found the answer, print "!" and the number of the node from which every other node can be reached by a single-colored path.

Interaction

To ask the direction of the green edge between nodes a and b, print "?", a and b in single line, separated by the space characters. 

In answer to this read a single integer, which will be 1 if the edge is directed from a to b and 0 if the edge is directed from b to a.

You can ask at most 2 ⋅ n queries, otherwise you will get Wrong Answer.

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. 



Answer -1 instead of 0 or 1 means that you made an invalid query or exceeded the query limit. Exit immediately after receiving -1 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.

Hacks

Hacks should be formatted as follows.

The first line should contain two integers n and m (1 ≤ n ≤ 300, 0 ≤ m ≤ n ⋅ (n - 1) / 2) — the number of nodes and number of pink edges.

The next m lines should describe the pink edges, the i-th line should contain 2 integers a_i, b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i), which means that there is a pink edge from a_i to b_i. All unordered pairs (a_i, b_i) should be distinct.

The next (n ⋅ (n - 1) / 2 - m) lines should describe the green edges, the i-th line should contain two integers a_i, b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i)), which means that there is a green edge from a_i to b_i. All unordered pairs of (a_i, b_i) should be distinct and should also be different from the pairs for the pink edges.

Example

Input


4 2
1 2
3 4
0
1
1

Output


? 1 3
? 4 2
? 3 2
! 3

Note

In the example above the answer for the query "? 1 3" is 0, so the edge is directed from 3 to 1. The answer for the query "? 4 2" is 1, so the edge is directed from 4 to 2. The answer for the query "? 3 2" is 1, so the edge is directed from 3 to 2. So there are green paths from node 3 to nodes 1 and 2 and there is a pink path from node 3 to node 4.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c *x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug &operator<<(const c &) {
    return *this;
  }
};
using ll = long long;
vector<vector<int>> all;
class Graph {
  int V;
  list<int> *adj;
  void fillOrder(int v, bool visited[], stack<int> &Stack);
  void DFSUtil(int v, bool visited[]);

 public:
  Graph(int V);
  void addEdge(int v, int w);
  void printSCCs();
  Graph getTranspose();
};
Graph::Graph(int _V) {
  this->V = _V;
  adj = new list<int>[_V];
}
vector<int> last;
void Graph::DFSUtil(int v, bool visited[]) {
  visited[v] = true;
  last.push_back(v);
  list<int>::iterator i;
  for (i = adj[v].begin(); i != adj[v].end(); ++i)
    if (!visited[*i]) DFSUtil(*i, visited);
}
Graph Graph::getTranspose() {
  Graph g(V);
  for (int v = 0; v < V; v++) {
    list<int>::iterator i;
    for (i = adj[v].begin(); i != adj[v].end(); ++i) {
      g.adj[*i].push_back(v);
    }
  }
  return g;
}
void Graph::addEdge(int v, int w) { adj[v].push_back(w); }
void Graph::fillOrder(int v, bool visited[], stack<int> &Stack) {
  visited[v] = true;
  list<int>::iterator i;
  for (i = adj[v].begin(); i != adj[v].end(); ++i)
    if (!visited[*i]) fillOrder(*i, visited, Stack);
  Stack.push(v);
}
void Graph::printSCCs() {
  stack<int> Stack;
  bool *visited = new bool[V];
  for (int i = 0; i < V; i++) visited[i] = false;
  for (int i = 0; i < V; i++)
    if (visited[i] == false) fillOrder(i, visited, Stack);
  Graph gr = getTranspose();
  for (int i = 0; i < V; i++) visited[i] = false;
  while (Stack.empty() == false) {
    int v = Stack.top();
    Stack.pop();
    if (visited[v] == false) {
      last.clear();
      gr.DFSUtil(v, visited);
      all.push_back(last);
    }
  }
}
const int nax = 2e5 + 5;
int gg[nax];
vector<int> inv[nax];
int in[nax];
vector<int> memo[nax];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  Graph gr(n);
  vector<pair<int, int>> edges;
  for (int i = 0; i < m; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    --a;
    --b;
    gr.addEdge(a, b);
    edges.emplace_back(a, b);
    memo[a].push_back(b);
  }
  gr.printSCCs();
  debug() << " ["
          << "all"
             ": "
          << (all) << "] ";
  for (int i = 0; i < (int)all.size(); ++i) {
    inv[i] = all[i];
    for (int x : all[i]) {
      gg[x] = i;
    }
  }
  for (pair<int, int> p : edges) {
    if (gg[p.first] != gg[p.second]) {
      ++in[gg[p.second]];
    }
  }
  int a = -1;
  for (int i = 0; i < n; ++i) {
    if (!in[gg[i]]) {
      a = i;
      break;
    }
  }
  assert(a != -1);
  set<int> ggs;
  for (int i = 0; i < (int)all.size(); ++i) {
    if (in[i] == 0) {
      ggs.insert(i);
    }
  }
  {
    int me = gg[a];
    for (int i = 0; i < (int)inv[me].size(); ++i) {
      if (inv[me][i] == a) {
        swap(inv[me][i], inv[me].back());
        inv[me].pop_back();
      }
    }
  }
  auto rem = [&](int g) {
    g = gg[g];
    if (!inv[g].empty()) {
      return;
    }
    for (int x : all[g]) {
      for (int y : memo[x]) {
        if (gg[x] == gg[y]) {
          continue;
        }
        if (--in[gg[y]] == 0) {
          ggs.insert(gg[y]);
        }
        assert(in[gg[y]] >= 0);
      }
    }
    ggs.erase(g);
  };
  while (true) {
    int me = gg[a];
    if ((int)ggs.size() == 1) {
      assert(ggs == set<int>{me});
      break;
    }
    auto it = ggs.find(me);
    if (it == ggs.begin()) {
      ++it;
    } else {
      --it;
    }
    int he = *it;
    int b = inv[he].back();
    inv[he].pop_back();
    printf("? %d %d\n", a + 1, b + 1);
    fflush(stdout);
    int r;
    scanf("%d", &r);
    if (r == 1) {
      rem(b);
    } else {
      assert(r == 0);
      rem(a);
      a = b;
    }
  }
  printf("! %d\n", a + 1);
}