#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 2e5 + 3, MOD = 998244353;//1e9 + 7;


int main() {

    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    int n;
    cin >> n;

    if(n <= 20)
    {
        vector<int> ans ;

        for (int i = 1; i <= n; ++i) {
            cout << "? " << 1 << " " << i << endl ;

            int k ;
            cin >> k;
            ans.push_back(k) ;
            for (int j = 0; j < k; ++j) {
                int x;
                cin >> x;
                ans.push_back(x) ;
            }
        }

        cout << "! " ;
        for(int ch : ans ) cout << ch << " " ;

        return 0 ;
    }

    vector<int> ids ;

    vector<bool> taken(n+1) ;

    while ( (int)ids.size() < 18)
    {
        int id = (1ll*rand()*rand())%n + 1;
        while (taken[id]) id = (1ll*rand()*rand())%n + 1;

        taken[id] =1 ;

        ids.push_back(id) ;
    }

    cout << "? " << 18 << " " ;

    for(int id : ids) cout << id << " " ;
    cout << endl ;

    int sz ;
    cin >> sz ;
    vector<int> v(sz) ;

    for (int i = 0; i < sz; ++i) {
        cin >> v[i] ;
    }

    int final = 0;

    vector<int> ans[n+1];

    vector<int> eles;
    taken.assign(n+1 , 0) ;


    for (int i = 0; i < n; ++i) {
        int el = (1ll*rand()*rand())%n + 1;
        while (taken[el] ) el = (1ll*rand()*rand())%n + 1;
        taken[el] =1 ;
        eles.push_back(el) ;
    }


    while (final < n)
    {
        vector<int> ask ;
        ask.push_back(eles[final++]) ;

        int ti =0 ;

        while ( final < n  && (int)ask.size() + 19 <= n  )
        {
            for(int id : ids) ask.push_back(id) ;
            ask.push_back(eles[final++]);

            ti++ ;
        }

        cout << "? " << (int)ask.size() << " " ;
        for(int ch : ask) cout << ch << " " ;
        cout << endl ;

        int sz2 ;
        cin >> sz2 ;
        vector<int> vv(sz2) ;
        for (int i = 0; i < sz2; ++i) {
            cin >> vv[i] ;
        }

        vector<int> del ;

        for(int i =1 ; i < sz2 - 1 ; i ++)
        {
            int j = 0 ;

            while (j < sz && i+j < sz2-1 && v[j] == vv[i+j])j++ ;

            if(j == sz)
            {
                del.push_back(i) ;

                i += sz ;
            }
        }

        assert((int)del.size() == ti) ;

        del.push_back(sz2) ;

        int j =0 , k =0 ;

        for(int i = 0 ; i < (int)ask.size() ; i += 19)
        {
            while (j != del[k] )
            {
                ans[ask[i]].push_back(vv[j]) ;

                j++ ;
            }

            j += sz ;

            k++ ;
        }
    }

    cout << "! " ;

    for(int i= 1; i <= n; i++)
    {
        cout << (int)ans[i].size() << " " ;

        assert((int)ans[i].size() ) ;
        for(int ch : ans[i]) cout << ch << " " ;
    }


    return 0;
}