#include<bits/stdc++.h>
#include "avoid.h"
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
// #define int ll
// #define N 
using namespace std;
const int d[4]={3,5,7,11};
const int B=35;
mt19937_64 rnd(time(0));
ll val[1005];
pair<int,int> scout(int R, int H)
{
    for (int i=1;i<=1000;i++)
    {
        poly ww(B,0);
        for (int j=0;j<B;j++) ww[j]=j;
        shuffle(ww.begin(),ww.end(),rnd);
        for (int j=0;j<15;j++) val[i]|=(1ll<<ww[j]);
    }
    unordered_map<ll,int>Mp;
    for (int i=1;i<=1000;i++)
        for (int j=i;j<=1000;j++) 
        {
            // cout<<i<<" "<<j<<" "<<(val[i]|val[j])<<endl;
            // assert(!Mp.count(val[i]|val[j]));
            Mp[val[i]|val[j]]=1;
        }
    for (int i=0;i<B;i++)
    {
        poly now;
        for (int j=1;j<=1000;j++)
            if ((val[j]>>i)&1) now.push_back(j);
        send(now);
    }
    poly now=wait();
    ll res=0;
    for (int i=0;i<sz(now);i++)
        if (now[i]) res|=(1ll<<i);
    for (int i=1;i<=1000;i++)
        for (int j=i;j<=1000;j++)
            if (res==(val[i]|val[j]))
            {
                return mp(i,j);
            }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/