#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> known(n);
  vector<int> value(n);
  map<int, int> pos;
  for (int i = 0; i < n - k + 1; i++) {
    cout << "? ";
    for (int j = 0, l = 0; j < n && l < k; j++) {
      if (known[j] == 0) {
        cout << j + 1 << ' ';
        l++;
      }
    }
    cout << endl;
    int p, v;
    cin >> p >> v;
    p--;
    known[p] = 1;
    value[p] = v;
    pos[v] = p;
  }
  auto it = pos.begin();
  int unu = it->second + 1;
  it++;
  int doi = it->second + 1;
  int m = 1;
  for (int i = 0; i < n; i++) {
    if (known[i] != 0) {
      continue;
    }
    cout << "? " << unu << ' ' << doi << ' ';
    for (int j = 0; j < n; j++) {
      if (known[j] != 1 && j != i) {
        cout << j + 1 << ' ';
      }
    }
    cout << endl;
    int p, v;
    cin >> p >> v;
    if (p == unu) {
      known[i] = 2;
    } else {
      m++;
      known[i] = -2;
    }
  }
  cout << "! " << m << endl;
  return 0;
}
