#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)]);
    auto dfs = [&](auto self, int l, int r) -> vector<int> {
        if (l + 1 == r){
            int L = 0;
            while (L < N){
                int R = L * 2;
                if (R > N) R = N;
                if (L == 0) R = 1;
                vector<int> A, B(R, p[l]);
                if (f(A, B, 0, R)){
                    L = R;
                }
                else{
                    while (R - L > 1){
                        int M = (R + L) / 2;
                        if (f(A, B, 0, M)) L = M;
                        else R = M;
                    }
                    break;
                }
            }
            return vector<int>(L, p[l]);
        }
        int m = (l + r) / 2;
        vector<int> A = self(self, l, m);
        vector<int> B = self(self, m, r);
        if (A.size() > B.size()) swap(B, A);
        vector<int> C;
        rep(x, 0, A.size()){
            int L = 0, R = 1;
            while (L < (int)B.size()){
                if (f(A, B, x, R)){
                    L = R, R *= 2;
                    R = min(R, (int)B.size());
                }
                else{
                    while (R - L > 1){
                        int M = (L + R) / 2;
                        if (f(A, B, x, M)) L = M;
                        else R = M;
                    }
                    break;
                }
            }
            rep(rp, 0, L) C.push_back(B[0]), B.erase(B.begin());
            C.push_back(A[x]);
        }
        for (auto x : B) C.push_back(x);
        return C;
    };
    auto ans = dfs(dfs, 0, N);
    cout << "!";
    for (auto x : ans) cout << " " << x + 1;
    cout << endl;
}