#include <bits/stdc++.h>
using namespace std;
int n, k, cnt[510], val[510];
int main() {
  int i, j, p0 = 0, p1 = 0;
  scanf("%d%d", &n, &k);
  for (i = 1; i <= k + 1; i++) {
    printf("?");
    for (j = 1; j <= k + 1; j++) {
      if (j != i) printf(" %d", j);
    }
    printf("\n");
    fflush(stdout);
    int p, v;
    scanf("%d%d", &p, &v);
    cnt[p]++;
    val[p] = v;
  }
  for (i = 1; i <= k + 1; i++) {
    if (cnt[i]) {
      if (p0 == 0)
        p0 = i;
      else
        p1 = i;
    }
  }
  if (val[p0] < val[p1]) swap(p0, p1);
  printf("! %d\n", cnt[p0]);
  return 0;
}
