#pragma GCC optimize(2)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#include "game.h"
// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\033[32m[" << __LINE__ << "]\033[0m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
const int N = 5e5 + 10;
int f[N], n, k;
vector <int> v[N], vv[N];
void init(int n, int k) {
	::n = n, ::k = k;
	// ms(f, 0x3f);
	F(i, 1, k) f[i] = i;
	// F(i, k + 1, n) f[i] = k + 1;
}
queue <int> q;
bool flag;
void update(int x, int y) {
	if (y <= k && f[x] >= y) flag = true;
	if (f[x] > f[y]) {
		f[y] = f[x];
		q.push(y);
	}
}
int add_teleporter(int x, int y) {
	x++, y++;
	v[x].push_back(y);
	vv[y].push_back(x);
	update(x, y);
	while (q.size()) {
		int x = q.front(); q.pop();
		for (int i: v[x]) update(x, i);
	}
	// F(i, 1, n) cout << f[i] << " "; cout << endl;
	// debug << x << " " << y << " " << flag << endl;
	return flag;
}