#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, pos, val;
  cin >> n >> k;
  vector<int> v2;
  for (int i = 1; i <= k + 1; ++i) {
    cout << "?";
    for (int j = 1; j <= k + 1; ++j)
      if (j == i)
        continue;
      else
        cout << " " << j;
    cout << endl;
    cin >> pos >> val;
    v2.push_back(val);
  }
  sort(v2.begin(), v2.end());
  int ans = 1;
  for (int i = k - 1; i >= 0; --i) {
    if (v2[i] == v2[i + 1])
      ++ans;
    else
      break;
  }
  cout << "! " << ans << flush;
}
