#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> numA;
int n, k, maxA;
int ask(int cIdx) {
  cout << "? ";
  for (int i = 1; i <= k + 1; ++i) {
    if (i != cIdx) {
      cout << i << " ";
    }
  }
  cout << endl;
  int res, p;
  cin >> p >> res;
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= k + 1; ++i) {
    int tmp = ask(i);
    numA[tmp]++;
    maxA = max(tmp, maxA);
  }
  cout << "! " << numA[maxA] << endl;
}
