Problem: This problem is interactive.

We have hidden an array a of n pairwise different numbers (this means that no two numbers are equal). You can get some information about this array using a new device you just ordered on Amazon. 

This device can answer queries of the following form: in response to the positions of k different elements of the array, it will return the position and value of the m-th among them in the ascending order.

Unfortunately, the instruction for the device was lost during delivery. However, you remember k, but don't remember m. Your task is to find m using queries to this device. 

You can ask not more than n queries.

Note that the array a and number m are fixed before the start of the interaction and don't depend on your queries. In other words, interactor is not adaptive.

Note that you don't have to minimize the number of queries, and you don't need to guess array a. You just have to guess m.

Input

The first line contains two integers n and k (1≤ k < n ≤ 500) — the length of the array and the number of the elements in the query.

It is guaranteed that number m satisfies 1≤ m ≤ k, elements a_1, a_2, ..., a_n of the array satisfy 0≤ a_i ≤ 10^9, and all of them are different.

Interaction

You begin the interaction by reading n and k.

To ask a question about elements on positions x_1, x_2, ..., x_k, in a separate line output

? x_1 x_2 x_3 ... x_k

Numbers in the query have to satisfy 1 ≤ x_i ≤ n, and all x_i have to be different. Don't forget to 'flush', to get the answer.

In response, you will receive two integers pos and a_{pos} — the position in the array a of the m-th in ascending order element among a_{x_1}, a_{x_2}, ..., a_{x_k}, and the element on this position.

In case your query is invalid or you asked more than n queries, the program will print -1 and will finish interaction. You will receive a Wrong answer verdict. Make sure to exit immediately to avoid getting other verdicts.

When you determine m, output 

! m

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.



Hack format

For the hacks use the following format:

The first line has to contain three integers n, k, m (1 ≤ m ≤ k < n ≤ 500) — the length of the array, number of elements in the query, and which in the ascending order number the device returns.

In the next line output n integers a_1, a_2, ..., a_n (0≤ a_i ≤ 10^9) — the elements of the array. They have to be pairwise different.

Example

Input


4 3
4 9
4 9
4 9
1 2

Output


? 2 3 4
? 1 3 4
? 1 2 4
? 1 2 3
! 3

Note

In the example, n = 4, k = 3, m = 3, a = [2, 0, 1, 9].

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int N;
int K;
int q[500];
int pos;
int val;
void query() {
  int i;
  printf("?");
  for (i = (0); i < (N); i++) {
    if (q[i]) {
      printf(" %d", i + 1);
    }
  }
  printf("\n");
  fflush(stdout);
  scanf("%d%d", &pos, &val);
  pos--;
}
void answer(int M) {
  printf("! %d\n", M);
  fflush(stdout);
  exit(0);
}
int main() {
  int i;
  int j;
  int k;
  int x;
  int fpos;
  int fval;
  int fg;
  int res;
  scanf("%d%d", &N, &K);
  if (K == 1) {
    answer(1);
  }
  for (i = (0); i < (K); i++) {
    q[i] = 1;
  }
  query();
  fpos = pos;
  fval = val;
  x = 0;
  if (k == pos) {
    x++;
  }
  for (i = (K); i < (N); i++) {
    swap(q[x], q[i]);
    query();
    swap(q[x], q[i]);
    if (val != fval) {
      if (val > fval) {
        fg = 1;
      } else {
        fg = -1;
      }
      res = 1;
      for (j = (0); j < (K); j++) {
        if (j != x && j != fpos) {
          swap(q[i], q[j]);
          query();
          swap(q[i], q[j]);
          if (val != fval) {
            res++;
          }
        }
      }
      if (fg == 1) {
        res++;
      } else {
        res = K - res;
      }
      answer(res);
    }
  }
  res = fg = 0;
  for (i = (0); i < (K); i++) {
    if (i != x && i != fpos) {
      swap(q[i], q[N - 1]);
      query();
      swap(q[i], q[N - 1]);
      if (fval != val) {
        res++;
        if (fval > val) {
          fg = -1;
        } else {
          fg = 1;
        }
      }
    }
  }
  if (fg) {
    if (fg == 1) {
      res++;
    } else {
      res = K - res;
    }
    answer(res);
  }
  swap(q[pos], q[N - 1]);
  query();
  swap(q[pos], q[N - 1]);
  if (fval > val) {
    res = K;
  } else {
    res = 1;
  }
  answer(res);
  return 0;
}