#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;
V<bool> self;
void init(int n, int k) {
K = k, N = n;
G.assign(n, {});
self.assign(n, 0);
f0r(i, k-1) G[i].pb(i+1);
}
V<bool> vis;
void dfs(int v, Adj &G, vi &out) {
vis[v] = 1;
forl(u, G[v]) if (!vis[u]) dfs(u, G, out);
out.pb(v);
}
vi sccs() {
int n = G.size();
vi ord;
vis.assign(n, 0);
f0r(i, n) if (!vis[i]) dfs(i, G, ord);
Adj rG(n);
f0r(i, n) forl(u, G[i]) rG[u].pb(i);
vis.assign(n, 0);
reverse(all(ord));
vi sz(n);
forl(v, ord) if (!vis[v]) {
vi comp;
dfs(v, rG, comp);
forl(u, comp) {
sz[u] = comp.size();
}
}
return sz;
}
bool check() {
vi sz = sccs();
f0r(i, K) if (sz[i] >= 2 || self[i]) return 1;
return 0;
}
int add_teleporter(int u, int v) {
if (u == v) self[u] = 1;
G[u].pb(v);
return check();
}
