#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "game.h"
Adj G;
int N, K;
const int MXN = 3e4+5;
V<bitset<MXN>> vis;
void init(int n, int k) {
K = k, N = n;
vis.assign(k, {});
G.assign(n, {});
f0r(i, k) vis[i].set(i);
}
int c;
bool dfs(int v) {
if (v <= c) return 1;
if (!vis[c][v]) {
vis[c].set(v);
forl(u, G[v]) if (dfs(u)) return 1;
}
return 0;
}
int add_teleporter(int u, int v) {
G[u].pb(v);
for (c = 0; c < K; ++c) if (vis[c][u] && dfs(v)) return 1;
return 0;
}
