#include <bits/stdc++.h>
#pragma GCC target("avx2")
/*
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
#pragma GCC target("prefer-vector-width=512")
#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;
using i32 = int;
using i64 = long long;
using f32 = float;
using f64 = double;
using f80 = long double;

#define rep(i, n) for(i64 i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

template<class T>
istream& operator>>(istream& is, vector<T>& v) {
    for(int i = 0; i < (int)v.size(); i++) {
        is >> v[i];
    }
    return is;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for(int i = 0; i < (int)v.size(); i++) {
        if(i > 0) os << " ";
        os << v[i];
    }
    return os;
}

void YesNo(bool yn) {
    if(yn) cout << "Yes" << endl;
    else cout << "No" << endl;
}

void YesNoExit(bool yn) {
    YesNo(yn);
    exit(0);
}

template<class T, class U>
bool chmin(T &x, U y) {
    if(y < x) {
        x = y;
        return true;
    }
    return false;
}

template<class T, class U>
bool chmax(T &x, U y) {
    if(y > x) {
        x = y;
        return true;
    }
    return false;
}

struct UnionFind {
  vector<int> data;

  UnionFind() = default;

  explicit UnionFind(size_t sz) : data(sz, -1) {}

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }

  int find(int k) {
    if (data[k] < 0) return (k);
    return data[k] = find(data[k]);
  }

  int size(int k) { return -data[find(k)]; }

  bool same(int x, int y) { return find(x) == find(y); }

  vector<vector<int> > groups() {
    int n = (int)data.size();
    vector<vector<int> > ret(n);
    for (int i = 0; i < n; i++) {
      ret[find(i)].emplace_back(i);
    }
    ret.erase(remove_if(begin(ret), end(ret),
                        [&](const vector<int>& v) { return v.empty(); }),
              end(ret));
    return ret;
  }
};

void out() { cout << '\n'; }
template <class T, class... Ts>
void out(const T& a, const Ts&... b) {
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}

vector<i32> dx4 = {0, 1, 0, -1};
vector<i32> dy4 = {1, 0, -1, 0};
vector<i32> dx8 = {0, 1, 0, -1, 1, 1, -1, -1};
vector<i32> dy8 = {1, 0, -1, 0, 1, -1, 1, -1};

const i64 mod = 998244353;

void solve() {
    // 誤読しててワロタ
    i32 N; cin >> N;

    i32 log = 32 - __builtin_clz(N - 1);
    i32 sz = 1 << log;

    using P = pair<i32, i32>; // {x, i} ith x
    vector<vector<P>> tree(2 * sz, vector<P>());
    vector<i32> cnt(N, 0);

    auto askvec = [&](vector<i32> arr) -> bool {
        out("?", (int)arr.size(), arr);
        string flag; cin >> flag;
        return flag == "Yes";
    };

    auto ask = [&](P p, P q) -> bool {
        if(p.first > N && q.first > N) return p < q; // any
        if(q.first > N) return true;
        if(p.first > N) return false;
        if(p.first == q.first) return p.second < q.second;
        vector<i32> front(p.second, p.first);
        vector<i32> back(cnt[q.first - 1] - q.second + 1 , q.first);
        i32 size = front.size() + back.size();
        out("?", size, front, back);
        string flag; cin >> flag;
        return flag == "Yes";
    };

    auto merge = [&](vector<P> a, vector<P> b) {
        vector<P> c;
        int j = 0;
        for(int i = 0; i < (int)a.size(); ++i) {
            while(j < (int)b.size() && !ask(a[i], b[j])) {
                c.push_back(b[j]);
                j++;
            }
            c.push_back(a[i]);
        }
        for(int k = j; k < (int)b.size(); ++k) {
            c.push_back(b[k]);
        }
        return c;
    };

    for(i32 i = 0; i < N; ++i) {
        for(i32 j = 1; j <= N; ++j) {
            vector<i32> arr(j, i + 1);
            if(askvec(arr)) cnt[i] = j; 
            else break;
        }
    }
    
    int count = 0;
    rep(i, N) {
        rep(j, cnt[i]) {
            tree[count + sz] = {{i + 1, j + 1}};
            count++;
        }
    }

    for(int i = count; i < sz; ++i) {
        tree[i + sz] = {{i + 1, 1}};
    }

    for(int i = sz - 1; i >= 1; --i) {
        // out("Process", i);
        tree[i] = merge(tree[2 * i + 0], tree[2 * i + 1]);
    }  

    cout << "! ";
    rep(i, N) {
        if(i) cout << " ";
        cout << tree[1][i].first;
    }
    cout << endl;

}

int main() {
    int TESTCASE = 1;
    // cin >> TESTCASE;
    while(TESTCASE--) {
        solve();
    }
}