#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const long long INF = numeric_limits<long long>::max();
vector<long long> readVec(long long n) {
  vector<long long> result;
  result.resize(static_cast<std::size_t>(n));
  for (long long i = 0; i < n; i++) {
    long long a;
    cin >> a;
    result[static_cast<std::size_t>(i)] = a;
  }
  return result;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  map<long long, long long> counter;
  for (long long i = 0; i < k + 1; i++) {
    cout << "? ";
    for (long long b = 0; b < k + 1; b++) {
      if (i != b) {
        cout << b + 1 << " ";
      }
    }
    cout << endl;
    fflush(stdout);
    long long pos, apos;
    cin >> pos;
    if (pos == -1) {
      return;
    }
    cin >> apos;
    counter[apos]++;
  }
  cout << "! " << k - (counter.begin()->second) + 1 << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1;
  for (int i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
