#include "game.h"
#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
if(pvaspace) b << " "; pvaspace=true;\
b << pva;\
}\
b << "\n";}
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
const ll MOD = 1000000007;
const ll MAX = 2147483647;
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
return o << '(' << p.F << ',' << p.S << ')';
}
ll ifloor(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a < 0) return (a - b + 1) / b;
else return a / b;
}
ll iceil(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a > 0) return (a + b - 1) / b;
else return a / b;
}
int n, k;
vector<set<int>> ls, rs;
vector<set<pii>> edge;
vector<map<int, vector<int>>> g, rg;
void build(int L = 0, int R = k - 1){
if(L > R) return;
int M = (L + R) / 2;
for(int i = L; i < M; i++) ls[M].insert(i);
for(int i = M + 1; i <= R; i++) rs[M].insert(i);
build(L, M - 1);
build(M + 1, R);
}
int ans = 0;
void addls(int M, int id){
if(rs[M].find(id) != rs[M].end() || M == id){
ans = 1;
}
ls[M].insert(id);
}
void addrs(int M, int id){
if(ls[M].find(id) != ls[M].end() || M == id){
ans = 1;
}
rs[M].insert(id);
}
void add(int u, int v, int L = 0, int R = k - 1){
if(L > R) return;
if(ans == 1) return;
int M = (L + R) / 2;
if(v == M || ls[M].find(v) != ls[M].end()){
addls(M, u);
add(u, v, L, M - 1);
while(!rg[M][u].empty()){
int t = rg[M][u].back();
rg[M][u].pob;
add(t, u, L, R);
}
}
else if(edge[M].find(mp(u, v)) == edge[M].end()) rg[M][v].eb(u);
if(u == M || rs[M].find(u) != rs[M].end()){
addrs(M, v);
add(u, v, M + 1, R);
while(!g[M][v].empty()){
int t = g[M][v].back();
g[M][v].pob;
add(v, t, L, R);
}
}
else if(edge[M].find(mp(u, v)) == edge[M].end()) g[M][u].eb(v);
edge[M].insert(mp(u, v));
}
void init(int _n, int _k){
n = _n;
k = _k;
ls.resize(n);
rs.resize(n);
g.resize(n);
rg.resize(n);
edge.resize(n);
build();
}
int add_teleporter(int u, int v){
add(u, v);
return ans;
}
