#include <bits/stdc++.h>
using namespace std;

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cout.tie(nullptr);
    int N;
    cin>>N;
    queue<vector<int>> q;
    vector<vector<vector<int>>> qq(N+1);
    string S;
    auto f = [&](vector<int> &s) -> void {
        cout<<"? "<<s.size();
        for(int x:s) cout<<' '<<x;
        cout<<endl;
        cin>>S;
        return;
    };
    for(int i=1;i<=N;i++){
        int n = 0;
        vector<int> t;
        while(true){
            vector<int> s(n+1,i);
            f(s);
            if(S == "No") break;
            else{
                n++;
                t = s;
            }
        }
        if(t.size()) qq[t.size()].push_back(t);
    }
    for(int i=0;i<=N;i++)for(auto s:qq[i]) q.push(s);
    while(q.size() > 1){
        auto a = q.front();
        q.pop();
        auto b = q.front();
        q.pop();
        vector<int> c = {};
        int ai = 0, bi = 0;
        vector<int> s;
        while(ai != a.size() || bi != b.size()){
            if(ai == a.size()){
                c.emplace_back(b[bi]);
                bi++;
                continue;
            }
            if(bi == b.size()){
                c.emplace_back(a[ai]);
                ai++;
                continue;
            }
            s = c;
            s.emplace_back(b[bi]);
            for(int i=ai;i<a.size();i++) s.emplace_back(a[i]);
            f(s);
            if(S == "Yes"){
                c.emplace_back(b[bi]);
                bi++;
                continue;
            }
            else{
                c.emplace_back(a[ai]);
                ai++;
                continue;
            }
        }
        q.push(c);
    }
    cout<<'!';
    auto a = q.front();
    for(int x:a) cout<<' '<<x;
    cout<<endl;
}