#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    int Z = 0;
    auto ask = [&](vector<int> p) -> int {
        Z++;
        assert(Z <= 5000);
        cout << "? " << p.size();
        for (auto x : p) cout << " " << x + 1;
        cout << endl;
        string S;
        cin >> S;
        if (S[0] == 'Y') return 1;
        return 0;
    };
    // A の x 番目に B の前 y 個を insert
    auto f = [&](vector<int> &A, vector<int> &B, int x, int y) -> int {
        vector<int> C;
        rep(i, 0, (int)A.size() + 1){
            if (i == x){
                rep(j, 0, y) C.push_back(B[j]);
            }
            if (i != (int)A.size()){
                C.push_back(A[i]);
            }
        }
        return ask(C);
    };
    vector<int> p(N);
    srand(clock());
    rep(i, 0, N) p[i] = i;
    rep(i, 0, N) swap(p[i], p[i + rand() % (N - i)]);
    vector<vector<int>> X;
    rep(i, 0, N){
        vector<int> tmp;
        while ((int)tmp.size() != N){
            tmp.push_back(i);
            if (ask(tmp) == 0){
                tmp.pop_back();
                break;
            }
        }
        X.push_back(tmp);
    }
    while ((int)X.size() > 2) {
        sort(all(X), [&](auto &l, auto &r){
            return l.size() < r.size();
        });
        auto A = X[0], B = X[1];
        X.erase(X.begin());
        X.erase(X.begin());
        vector<int> C;
        rep(x, 0, A.size()){
            while (!B.empty()){
                if (f(A, B, x, 1)){
                    C.push_back(B[0]);
                    B.erase(B.begin());
                }
                else break;
            }
            C.push_back(A[x]);
        }
        for (auto x : B) C.push_back(x);
        X.push_back(C);
    }
    auto ans = X[0];
    cout << "!";
    for (auto x : ans) cout << " " << x + 1;
    cout << endl;
}