#include "game.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;
template<class A, class B>
bool maximize(A& x, B y) {
if (x < y) return x = y, true; else return false;
}
template<class A, class B>
bool minimize(A& x, B y) {
if (x > y) return x = y, true; else return false;
}
/* END OF TEMPLATE */
const int N = 3e5 + 7;
int n, k;
vector<int> v[N], rv[N];
void init(int N, int K) {
n = N;
k = K;
REP(i, 0, k - 1) {
v[i].push_back(i + 1);
rv[i + 1].push_back(i);
}
}
void bfs(int x, int d[], vector<int> v[]) {
REP(i, 0, n) d[i] = -1;
queue<int> qu;
qu.push(x);
d[x] = 0;
while (!qu.empty()) {
int x = qu.front();
qu.pop();
for (auto y : v[x])
if (d[y] == -1) {
qu.push(y);
d[y] = d[x] + 1;
}
}
}
int d[2][N];
int add_teleporter(int x, int y) {
bfs(y, d[0], v);
bfs(x, d[1], rv);
REP(i, 0, k)
if (d[0][i] != -1 && d[1][i] != -1) return 1;
v[x].push_back(y);
rv[y].push_back(x);
return 0;
}
