#include<iostream>
#include<set>
#include<vector>
#include<unordered_set>
using namespace std;
typedef long long ll;
// time travelling multiset
class TTMS{
vector<int>days;
vector<multiset<int>>sets;
public:
TTMS(){
days={-1};
sets={{}};
}
void add_new_day(int day){
days.push_back(day);
sets.push_back(sets.back());
}
void insert(int el){
sets.back().insert(el);
}
void remove(int el){
sets.back().erase(sets.back().find(el));
}
vector<int> get(int day){
int i=0;
while(i<(int)days.size()-1&&days[i+1]<=day)
i++;
return {sets[i].begin(),sets[i].end()};
}
};
int get_closest(vector<int>a,vector<int>b){
int res=1e9;
for(int i:a)
for(int j:b){
res=min(res,abs(i-j));
}
return res;
}
int n;
int heights[100000];
TTMS ttms[100000];
void init(int N, int D, int H[]) {
n=N;
for(int i=0;i<n;i++)
heights[i]=H[i];
}
ll to(int a,int b){
if(a<b)
swap(a,b);
return a+((ll)b<<32);
}
void curseChanges(int U, int A[], int B[]) {
unordered_set<ll>conns;
for(int day=0;day<U;day++){
int a=A[day],b=B[day];
ll conn=to(a,b);
ttms[a].add_new_day(day+1);
ttms[b].add_new_day(day+1);
if(conns.find(conn)==conns.end()){
conns.insert(conn);
ttms[a].insert(heights[b]);
ttms[b].insert(heights[a]);
}else{
conns.erase(conn);
ttms[a].remove(heights[b]);
ttms[b].remove(heights[a]);
}
}
}
int question(int x, int y, int v) {
vector<int>a=ttms[x].get(v);
vector<int>b=ttms[y].get(v);
return get_closest(a,b);
}
