#include "ds.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<pair<int,int>>V;
vector<int>licz(int x, vector<int>P) {
  cout << "! licz " << x << ": ";
  for(auto i : P) cout << i << " ";
  cout << '\n';
  vector<pair<int,int>>T;
  vector<int>X;
  for(auto i : P) T.pb({query(i), i});
  sort(all(T));
  if(T.size()==1) {
    if(T[0].st!=x) {
      exchange(T[0].st, x);
      V.pb({T[0].st, x});
    }
    return P;
  }
  int l=0;
  for(int i=1; i<T.size(); ++i) if(T[i].st!=T[i-1].st) {
    vector<int>A;
    while(l<i) A.pb(T[l++].nd);
    if(T[l-1].st!=x) {
      exchange(T[l-1].st, x);
      V.pb({T[l-1].st, x});
    }
    A=licz(x, A);
    x+=A.size();
    for(auto j : A) X.pb(j);
  }
  vector<int>A;
  while(l<T.size()) A.pb(T[l++].nd);
  if(T[l-1].st!=x) {
    exchange(T[l-1].st, x);
    V.pb({T[l-1].st, x});
  }
  A=licz(x, A);
  for(auto j : A) X.pb(j);
  return X;
}
void solve(int n, int lim1, int lim2) {
  vector<int>T(n-1);
  rep(i, n-1) T[i]=i+2;
  T=licz(1, T);
  vector<int>par(n-1), val(n-1);
  rep(i, n-2) par[T[i+1]-2]=T[i];
  par[T[0]-2]=1;
  vector<int>P(n);
  rep(i, n) P[i]=i;
  reverse(all(V));
  for(auto i : V) swap(P[i.st], P[i.nd]);
  rep(i, n-1) val[T[i]-2]=P[i+1];
  answer(par, val);
}