#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, q;
std::cin >> n >> m >> q;
std::vector <int> arr;
for(int i=0; i<m; i++){
int x;
std::cin >> x;
arr.push_back(x);
arr.push_back(x+n);
arr.push_back(x+n+n);
}
sort(arr.begin(), arr.end());
for(int i=0; i<q; i++){
int a, b;
std::cin >> a >> b;
if(a>b) swap(a, b);
int ans=min(b-a, 2*n+a-b);
//else if theres like smth between both of these that can +n then try it ig
auto aft=upper_bound(arr.begin(), arr.end(), a+2*n);
aft--;
auto mid=lower_bound(arr.begin(), arr.end(), a);//check if <b ltr
if(aft!=arr.end() && *aft<= a+2*n){
int opp=*aft+n;
//std::cout << *aft << "]]]]]";
if(opp>=2*n) opp%=2*n;
//std::cout << opp << "]]]]";
int temp=abs(*aft-a-2*n)+1+abs(b-opp);
temp=min(temp, abs(*aft-a)+1+abs(b-opp));
ans=min(ans, temp);
}
if(mid!=arr.end() && *mid<=b){
int opp=*mid+n;
//std::cout << *mid << "]]]]]";
if(*mid>=2*n) opp%=2*n;
int temp=abs(*mid-a)+1+abs(opp-b);
ans=min(ans, temp);
}
std::cout << ans << "\n";
}
}
