#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793238462643383279;
const long long inf = 1000000000000000000ll;
const int N = 1000005, M = 998244353;
long long qpow(long long a, long long b) {
  long long s = a, ans = 1;
  while (b) {
    if (b & 1) ans = ans * s % M;
    b >>= 1;
    s = s * s % M;
  }
  return ans;
}
int n, k, a[N], i, p, f[N], mx, mn, j;
int main() {
  scanf("%d %d", &n, &k);
  for (i = 1; i <= k + 1; ++i) {
    printf("? ");
    int t = k;
    for (j = 1; j <= k + 1; ++j)
      if (i != j) {
        printf("%d ", j);
        --t;
      }
    printf("\n");
    fflush(stdout);
    scanf("%d", &p);
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + 2 + k);
  for (i = 2; i <= k + 1; ++i)
    if (a[i] != a[i - 1]) break;
  printf("! %d\n", k + 2 - i);
  fflush(stdout);
}
