// merge sort 解法
#include<bits/stdc++.h>
using namespace std;

bool query(const vector<int>& q) {
    cout << "? " << q.size() << " ";
    for(int i = 0; i < q.size(); i++) {
        cout << q[i] << " \n"[i==q.size()-1];
    }
    cout << flush;
    string s;
    cin >> s;
    return s == "Yes";
}

int n;
void answer(const vector<int>& ans) {
    assert(ans.size() == n);
    cout << "! ";
    for(int i = 0; i < n; i++) {
        cout << ans[i] << " \n"[i==n-1];
    }
    cout << flush;
}

vector<int> merge(const vector<int>& a, const vector<int>& b) {
    vector<int> merged = b;
    int now = 0;
    for(int i = 0; i < a.size(); i++) {
        while(true) {
            if(now == merged.size()) {
                merged.push_back(a[i]);
                now++;
                break;
            }
            vector<int> q = merged;
            q.insert(q.begin() + now, a[i]);
            if(query(q)) {
                merged.insert(merged.begin() + now, a[i]);
                now++;
                break;
            } else {
                now++;
            }
        }
    }

    return merged;
}

int main() {
    cin >> n;

    vector<vector<int>> groups;
    for(int i = 1; i <= n; i++) {
        int cnt = 1;
        for(; cnt <= n; cnt++) {
            if(!query(vector<int>(cnt, i))) break;
        }
        if (cnt == 1) continue;
        groups.push_back(vector<int>(cnt - 1, i));
    }

    while(groups.size() > 1) {
        sort(groups.begin(), groups.end(), [](const vector<int>& a, const vector<int>& b) {
            return a.size() > b.size();
        });
        vector<int> a = groups.back(); groups.pop_back();
        vector<int> b = groups.back(); groups.pop_back();
        vector<int> merged = merge(a, b);
        groups.push_back(merged);
    }

    answer(groups[0]);
}