// Problem: #P13098. 交互题
// Author: XZC(L_Wave)
// Language: Cpp/G++20
// Contest: Hydro
// URL: http://www.nfls.com.cn:10611/p/5472
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// Create Time: not 2024-12-03 20:49:39, but 1926-08-17 11:45:14
// 
// Powered by CP Editor (https://cpeditor.org)

#ifndef LOCAL
#include"interactive.h"
#else
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <numeric>
#include <random>
#include <chrono>

std::vector<int> solve(int n);
int query(std::vector<int> vec);

#define rep0(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
using namespace std;

namespace
{
	const int MAXN = 500, MAXQ = 300000;
	int n, ty, p[505], mat[505][505], cnt;
	bool vis[505];
	bool legal(const vector<int>& arr)
	{
		if((int)arr.size() != n) return false;
		rep1(i, n) vis[i] = false;
		rep0(i, arr.size()) {
			if(arr[i] < 1 || arr[i] > n || vis[arr[i]]) return false;
			vis[arr[i]] = true;
		}
		return true;
	}
}

int query(vector<int> arr)
{
	if(cnt == MAXQ || !legal(arr)) {
		printf("WA: 0\n"); exit(0);
	}
	
	int ret = 0;
	rep0(i, (int)arr.size() - 1) ret += mat[arr[i]][arr[i + 1]];
	cnt ++;
	return ret;
}

int main()
{
	scanf("%d%d", &ty, &n);
	iota(p+1,p+n+1,1);
	std::mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
	shuffle(p+1,p+n+1,rng);
	if (ty==1)
	rep1(i, n) scanf("%d", &p[i]);
	rep1(i, n - 1) mat[p[i]][p[i + 1]] = mat[p[i + 1]][p[i]] = 1;
	
	vector<int> ans = solve(n);
	if(!legal(ans)) printf("WA: 1\n");
	else {
		int sum = 0;
		rep0(i, n - 1) sum += mat[ans[i]][ans[i + 1]];
		if(sum == n - 1) printf("AC: %d\n", cnt);
		else printf("WA: 1\n");
	}
	exit(0);
}
#endif

#include <bits/stdc++.h>
#undef rep
#define rep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i <= i##ABRACADABRA; i++)
#define drep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i >= i##ABRACADABRA; i--)
using namespace std;
using ll = long long;

namespace local{

constexpr int K = 11000;

vector<int>res;
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
int id[505][505],p[505],now,n;
long double w[505][505];
bool vis[505],gt[505][505];

void getp(int u){
  p[++now]=u;
  vis[u]=1;
  rep(v,1,n)if (!gt[u][v]&&u!=v&&!vis[v]){
    // cout<<u<<" --> "<<v<<' '<<vis[v]<<' '<<now<<'\n';
    gt[u][v]=gt[v][u]=1;
    getp(v);
    return ;
  }
}

void dfs(int u){
  // cout<<u<<'\n';
  res.push_back(u);
  vis[u]=1;
  rep(v,1,n)if (!vis[id[u][v]]){
    dfs(id[u][v]);
    return ;
  }
}

int ask(){
  vector<int>Q;
  rep(i,1,n)Q.push_back(p[i]);
  return query(Q);
}

void adj(vector<pair<int,int>>V,long double val){
  val/=V.size();
  for (auto [x,y]:V)w[x][y]=w[y][x]=(w[x][y]*10+val)/11;
}

std::vector<int> solve(int _n){
  n=_n;
  rep(i,1,n)rep(j,1,n){
    if (i^j)w[i][j]=2.l/n;
    else w[i][j]=-1e9;
  }
  rep(i,1,K){
    now=0;
    if (i<n){
      memset(vis,0,sizeof(vis));
      getp(1);
      // cout<<n<<'\n';
      // rep(i,1,n)cout<<p[i]<<' ';
      // cout<<'\n';
    }
    if (now<n){
      iota(p+1,p+n+1,1);
      shuffle(p+1,p+n+1,rng);
    }
    int x=ask();
    // cout<<"$$ "<<x<<'\n';
    rep(t,1,n-1)if (w[p[t]][p[t+1]]>0.9999)--x;
    if (!x){
      rep(t,1,n-1)if (w[p[t]][p[t+1]]<=0.9999)w[p[t]][p[t+1]]=w[p[t+1]][p[t]]=-1e9;
      // rep(i,1,n)rep(j,1,n)cout<<w[i][j]<<" \n"[j==n];
      continue;
    }
    vector<pair<int,int>>V;
    rep(t,1,n-1)if (w[p[t]][p[t+1]]>0&&w[p[t]][p[t+1]]<=0.9999)V.push_back({p[t],p[t+1]});
    if (x==(int)V.size()){
      for (auto [x,y]:V)w[x][y]=w[y][x]=1;
      V.clear();
    }
    // if (V.size()==1)cout<<w[V[0].first][V[0].second]<<' '<<x<<'\n';
    adj(V,x);
    // if (V.size()==1)cout<<w[V[0].first][V[0].second]<<'\n';
    // if (x==-1){
      // rep(i,1,n)cout<<p[i]<<' ';
      // cout<<'\n';
      // rep(i,1,n-1)if (w[p[i]][p[i+1]]>0.9999)cout<<p[i]<<' '<<p[i+1]<<' '<<w[p[i]][p[i+1]]<<'\n';
    // }
    // rep(i,1,n)rep(j,1,n)cout<<w[i][j]<<" \n"[j==n];
  }
  int pos=0;
  long double mx=0;
  rep(i,1,n){
    iota(id[i]+1,id[i]+n+1,1);
    sort(id[i]+1,id[i]+n+1,[&](int x,int y){
      return w[i][x]>w[i][y];
    });
  }
  rep(i,1,n){
    memset(vis,0,sizeof(vis));
    res.clear();
    dfs(i);
    long double val=1;
    rep(i,0,n-2)val=min(val,w[res[i]][res[i+1]]);
    if (mx<val)mx=val,pos=i;
  }
  memset(vis,0,sizeof(vis));
  res.clear();
  dfs(pos);
  return res;
}

}

std::vector<int> solve(int n){return local::solve(n);}