#include<bits/stdc++.h>using namespace std;const int N = 1e5+10;typedef long long ll;ll arr[N];vector<ll> all;struct Q{ ll wz; int val;}x[N];int find(ll x){ return lower_bound(all.begin(),all.end(),x)-all.begin()+1;}int main(){ ll a,b,c; cin>>a>>b>>...