#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 7;
int pr[M];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k, ps, pv;
  cin >> n >> k;
  for (int i = 1; i <= k + 1; i++) {
    cout << "? ";
    for (int j = 1; j <= k + 1; j++) {
      if (i == j) continue;
      cout << j << " ";
    }
    cout << endl;
    cout.flush();
    cin >> ps >> pv;
    pr[i] = pv;
  }
  sort(pr + 1, pr + 2 + k);
  int nm = 0;
  pr[0] = pr[1];
  for (int i = 1; i <= k + 1; i++)
    if (pr[i] == pr[i - 1])
      nm++;
    else
      break;
  cout << "! " << k + 1 - nm << endl;
  return 0;
}
