#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool ooo = 1;
const int N = 1e6 + 1;
int n, m, k, mx = 0;
map<int, int> cnt;
void baka() {
  cin >> n >> k;
  n = min(n, k + 1);
  for (int i = 1; i <= n; i++) {
    cout << "? ";
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      cout << j << ' ';
    }
    cout << endl;
    int v;
    cin >> v >> v;
    mx = max(mx, v);
    cnt[v]++;
  }
  cout << "! " << cnt[mx] << endl;
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  ooo = 0;
  int t = 1;
  while (t--) {
    baka();
  }
}
