#include <bits/stdc++.h>
using namespace std;
double PI = 3.141592653589793238462643383279;
const double EPS = 1e-9;
const long long MOD = 1000000007;
const int inf = 1 << 30;
const long long linf = 1LL << 60;
int k, n;
int cnt[501];
int val[501];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < (int)k + 1; i++) {
    printf("?");
    for (int j = 0; j < (int)k + 1; j++) {
      if (j == i) continue;
      printf(" %d", j + 1);
    }
    puts("");
    fflush(stdout);
    int p, a;
    scanf("%d%d", &p, &a);
    p--;
    cnt[p]++;
    val[p] = a;
  }
  int p1 = -1, p2 = -1;
  for (int i = 0; i < (int)n; i++) {
    if (cnt[i] != 0) {
      if (p1 == -1) {
        p1 = i;
      } else {
        p2 = i;
      }
    }
  }
  printf("! ");
  if (val[p1] > val[p2])
    printf("%d\n", cnt[p1]);
  else
    printf("%d\n", cnt[p2]);
}
