#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 2e5 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<int> ask(vector<int> v) {
    cout << "? " << v.size() << ' ';
    for (auto x: v)cout << x + 1 << ' ';
    cout << endl;
    int sz;
    cin >> sz;
    vector<int> ret;
    for (int i = 0; i < sz; ++i) {
        int x;
        cin >> x;
        ret.push_back(x);
    }
    return ret;
}

void solve() {
    int n;
    cin >> n;
    vector<int> p(n);
    iota(all(p), 0);
    shuffle(all(p), rng);
    vector<vector<int>> ans(n);
    vector<int> ind;
    vector<int> pat;
    int sz = 0;
    for (int i = 0; i < n; ++i) {
        if (sz >= 10) {
            int j = i;
            vector<int> nxt(p[j]);
            while (j + 1 < n && nxt.size() + ind.size() + 1 <= n) {
                for (auto x: ind)nxt.push_back(x);
                j++;
                nxt.push_back(p[j]);
            }
            vector<int> ret = ask(nxt);
            vector<int>e(ret[0]);
            int cur = i, ptr = 0;
            for (int k = 1; k < ret.size() && cur < j; ++k) {
                assert(k + pat.size() < ret.size());
                bool ok = true;
                for (int l = k; l < k + pat.size() && ok; ++l) {
                    ok &= pat[l - k] == ret[l];
                }
                if (ok) {
                    ans[p[cur]] = e;
                    e.clear();
                    cur++;
                    ptr = k + pat.size();
                    e.push_back(ret[ptr]);
                    k = ptr;
                }
                else {
                    e.push_back(ret[k]);
                }
            }
            assert(cur == j);
            for (int k = ptr; k < ret.size(); ++k) {
                ans[p[j]].push_back(ret[k]);
            }
            i = j;
        } else {
            vector<int> ret = ask({p[i]});
            ans[p[i]] = ret;
            ind.push_back(p[i]);
            for (auto x: ret)pat.push_back(x);
            sz += ret.size();
        }
    }
    cout << "! ";
    for (int i = 0; i < n; ++i) {
        cout << ans[i].size() << ' ';
        for (auto x: ans[i])cout << x << ' ';
    }
    cout << endl;
}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}