#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k, i, j, x, y, maxi = 0;
  map<long long, long long> ma;
  cin >> n >> k;
  for (i = 1; i <= k + 1; i++) {
    cout << "? ";
    for (j = 1; j <= k + 1; j++) {
      if (i == j) continue;
      cout << j << " ";
    }
    cout << endl;
    cout.flush();
    cin >> x >> y;
    ma[y]++;
    maxi = max(maxi, y);
  }
  cout << "! " << ma[maxi] << endl;
  cout.flush();
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
