#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxN = (int)1e5+10;
const int B = 150;
using ar2 = array<int,2>;
int n, m;
int a[mxN];
const int totB = (int)5e4/B+2;
set<ar2> S[totB][mxN];
vector<ar2> v;
void init(int N, int D, int H[]) {
n = N;
for(int i = 0; i < n; i++) a[i]=H[i];
}
void toggle(int x, int y, int t){
if(S[t][x].count({a[y],y})) S[t][x].erase({a[y],y});
else S[t][x].insert({a[y],y});
}
void curseChanges(int U, int A[], int _B[]) {
m = U;
for(int i = 0; i < m; i++){
int x = A[i], y = _B[i]; v.pb({x,y});
for(int j = i/B; j < totB-1; j++)
toggle(x,y,j+1), toggle(y,x,j+1);
}
}
int question(int x, int y, int t) {
int ans = (int)1e9; if(!t) return ans;
int origT = t; t/=B;
for(int i = t*B; i < origT; i++)
toggle(v[i][0],v[i][1],t),toggle(v[i][1],v[i][0],t);
if(!sz(S[t][x]) or !sz(S[t][y])){
for(int i = t*B; i < origT; i++)
toggle(v[i][0],v[i][1],t),toggle(v[i][1],v[i][0],t);
return ans;
}
auto itr = begin(S[t][y]);
for(auto [u,v] : S[t][x]){
while(itr!=end(S[t][y]) and (*itr)[0] < u) itr++;
if(itr!=begin(S[t][y])) ans=min(ans, abs(u-(*prev(itr))[0]));
if(itr!=end(S[t][y])) ans=min(ans, abs(u-(*itr)[0]));
}
for(int i = t*B; i < origT; i++)
toggle(v[i][0],v[i][1],t),toggle(v[i][1],v[i][0],t);
return ans;
}
