#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pii;
const ll inf = 1e18;
const int i_inf = 1e9;
const ll mod = 1e9+7;
const int mxn = 505;
#include "coprobber.h"
int n;
vector<int> g[mxn];
vector<int> gc[mxn];
int nxt[mxn][mxn];
int cnt[mxn][mxn];
bool vis[mxn][mxn];
void dfs(int u, int v){
for(auto e1 : g[v]){
cnt[u][e1] ++;
if(cnt[u][e1] == (int)g[e1].size()){
for(auto e2 : gc[u]){
if(!vis[e2][e1]){
vis[e2][e1] = true;
nxt[e2][e1] = u;
dfs(e2, e1);
}
}
}
}
}
bool update_status(int u, int v){
if(vis[u][v]) return false;
for(auto e1 : gc[u]){
if(cnt[e1][v] == (int)g[v].size()){
nxt[u][v] = e1;
vis[u][v] = 1;
for(auto e2 : g[v]){
cnt[u][e2] ++;
}
return true;
}
}
return false;
}
int cop;
int start(int N, bool A[MAX_N][MAX_N])
{
n = N;
fr(i, 0, n){
gc[i].pb(i);
fr(j, 0, n){
if(A[i][j]){
g[i].pb(j);
gc[i].pb(j);
}
}
}
fr(i, 0, n) vis[i][i] = true;
fr(i, 0, n) nxt[i][i] = i;
queue<pii> Q;
fr(i, 0, n){
fr(j, 0, n){
if(A[i][j]){
nxt[i][j] = j;
vis[i][j] = true;
Q.push({i, j});
}
}
}
while(!Q.empty()){
int u = Q.front().st;
int v = Q.front().nd;
Q.pop();
for(auto e1 : g[v]){
cnt[u][e1] ++;
if(cnt[u][e1] == (int)g[e1].size()){
for(auto e2 : gc[u]){
if(!vis[e2][e1]){
vis[e2][e1] = true;
nxt[e2][e1] = u;
Q.push({e2, e1});
}
}
}
}
}
/*
fr(i, 0, n){
fr(j, 0, n){
if(i == j){
bit[i][j] = 1;
nxt[i][j] = j;
}
else if(A[i][j]){
bit[i][j] = 1;
nxt[i][j] = j;
for(auto e2 : g[j]){
cnt[i][e2] ++;
}
//nxt[i][j] = j;
//bad[i][j] = true;
}
}
}
*/
/*bool progress = true;
while(progress){
progress = false;
fr(i, 0, n){
fr(j, 0, n){
progress |= update_status(i, j);
}
}
}*/
fr(i, 0, n){
bool cand = true;
fr(j, 0, n){
cand &= vis[i][j];
}
if(cand){
cop = i;
return i;
}
}
return -1;
}
int nextMove(int R)
{
cop = nxt[cop][R];
return cop;
}
