#include <bits/stdc++.h>
using namespace std;
namespace {
const int N = 1e5 + 3;
int n, d, m, h[N], a[N], b[N];
set <int> s[N];
}
void swap(int &a, int &b) {
a = a ^ b;
b = a ^ b;
a = a ^ b;
}
int min(int x, int y) {
if (x < y) return x;
return y;
}
int max(int x, int y) {
if (x > y) return x;
return y;
}
void init(int N, int D, int H[]) {
n = N;
d = D;
for (int i = 1; i <= n; i++) {
h[i] = H[i - 1];
}
}
void upd(int id, int x) {
bool ok = s[id].find(x) != s[id].end();
if (ok) s[id].erase(x);
else s[id].insert(x);
}
void curseChanges(int U, int A[], int B[]) {
m = U;
for (int i = 1; i <= m; i++) {
a[i] = A[i - 1] + 1;
b[i] = B[i - 1] + 1;
upd(a[i], b[i]);
upd(b[i], a[i]);
}
}
int question(int x, int y, int v) {
x++;
y++;
set <int> act;
for (int it: s[y]) {
act.insert(h[it]);
// cout << y << ' ' << it << '\n';
}
int ans = 1e9;
for (int i: s[x]) {
// cout << x << ' ' << i << '\n';
auto cur = act.lower_bound(h[i]);
if (cur != act.end()) ans = min(ans, abs(h[i] - *cur));
if (cur == act.begin()) continue;
cur--;
ans = min(ans, abs(h[i] - *cur));
}
return ans;
}
