/** author: shobonvip created: 2025.03.21 22:02:59 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n;cin>>n; int ka,kb;cin>>ka>>kb; vectora(ka),b(kb); rep(i,0,ka){ cin>>a[i]; a[i]--; } rep(i,0,kb){ cin>>b[i]; b[i]--; } vector d1(n,1e9); vector d2(n,1e9); deque mada; rep(i,0,ka){ d1[a[i]]=0; mada.push_back(a[i]); } while(!mada.empty()){ int i=mada.back(); mada.pop_back(); if(i-1>=0){ if(chmin(d1[i-1],d1[i]+1)){ mada.push_back(i-1); } } if(i+1=0){ if(chmin(d2[i-1],d2[i]+1)){ mada.push_back(i-1); } } if(i+1>q; while(q--){ int s,t;cin>>s>>t; s--;t--; int ans=abs(s-t); chmin(ans,d1[s]+d1[t]); chmin(ans,d2[s]+d2[t]); chmin(ans,d1[s]+dist_warp+d2[t]); chmin(ans,d2[s]+dist_warp+d1[t]); cout<