#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int MAXN = 100005;
int n, m, d;
int h[MAXN], a[MAXN], b[MAXN];
set < int > st[MAXN];
vector < int > val[MAXN];
void init(int N, int D, int H[]) {
n = N, d = D;
for(int i = 0; i < n; i++) h[i] = H[i];
}
void curseChanges(int U, int A[], int B[]) {
m = U;
for(int i = 0; i < m; i++) a[i] = A[i], b[i] = B[i];
for(int i = 0; i < m; i++){
if(st[a[i]].find(b[i]) == st[a[i]].end()) st[a[i]].insert(b[i]), st[b[i]].insert(a[i]);
else st[a[i]].erase(b[i]), st[b[i]].erase(a[i]);
}
for(int i = 0; i < n; i++){
for(auto it : st[i]) val[i].push_back(h[it]);
sort(all(val[i]));
}
}
int question(int x, int y, int v) {
int ans = 1000000000;
for(int i = 0; i < val[x].size(); i++)
for(int j = 0; j < val[y].size(); j++)
ans = min(ans, abs(val[x][i] - val[y][j]));
return ans;
}
/*
Test g++ grader.cpp potion.cpp -o program.exe
6 5 11 4
2 42 1000 54 68 234
0 1
2 0
3 4
3 5
3 5
1 3
5 3
0 5
3 0
1 3
3 5
0 3 4 26
3 0 8 0
0 5 5 1000000000
3 0 11 14
*/
