#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long N, K, E, Q, a, b, c, d, t, ans, cnt;
long long A[200100];
pair<long long, long long> query() {
  cout << "? ";
  int e = 0;
  for (int i = 1; i <= N; ++i)
    if (A[i]) {
      ++e;
      cout << i << ' ';
    }
  assert(e == K);
  cout << endl;
  cin >> a >> b;
  return make_pair(a, b);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> K;
  for (int i = 1; i <= K; ++i) {
    A[i] = 1;
  }
  pair<long long, long long> cur = query();
  bool isabove = 0;
  A[N] = 1;
  A[cur.first] = 0;
  pair<long long, long long> t = query();
  if (t.second > cur.second) isabove = 1;
  A[cur.first] = 1;
  vector<long long> lower;
  vector<long long> upper;
  vector<long long> same;
  for (int i = 1; i <= K; ++i)
    if (i != cur.first) {
      A[i] = 0;
      pair<long long, long long> t = query();
      if (t.second == cur.second) same.emplace_back(i);
      if (t.second > cur.second) lower.emplace_back(i);
      if (t.second < cur.second) upper.emplace_back(i);
      A[i] = 1;
    }
  assert(min((int)upper.size(), (int)lower.size()) == 0);
  cout << "! ";
  if (isabove) {
    cout << (int)lower.size() + 1;
  } else {
    cout << (int)same.size() + 1;
  }
}
