#include <bits/stdc++.h>
using namespace std;
int a[505], is[3];
int main() {
  int n, k, pos, pos1, pos2;
  cin >> n >> k;
  cout << "? ";
  for (int i = 1; i <= k; i++) cout << i << ' ';
  cout << endl;
  cin >> pos;
  cin >> a[pos];
  cout << "? ";
  for (int i = 1; i <= k + 1; i++) {
    if (i == pos) continue;
    cout << i << ' ';
  }
  cout << endl;
  cin >> pos1;
  cin >> a[pos1];
  bool ok = (a[pos] < a[pos1] ? 1 : 0);
  for (int i = 1; i <= k; i++) {
    if (i != pos) {
      cout << "? ";
      for (int it = 1; it <= k + 1; it++)
        if (it != i) cout << it << ' ';
      cout << endl;
      cin >> pos2;
      cin >> a[pos2];
      if (pos2 == pos)
        is[ok] += 1;
      else
        is[ok ^ 1]++;
    }
  }
  is[0] += 1;
  int jilo = is[0];
  cout << "! " << jilo;
  return 0;
}
