#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t 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
bool can=false;
auto aft=upper_bound(arr.begin(), arr.end(), a+2*n);
if(aft!=arr.begin())aft--, can=true;
auto mid=lower_bound(arr.begin(), arr.end(), a);//check if <b ltr
if(can && *aft<= a+2*n && *aft>=b){
int opp=(*aft+n)%(2*n);
int temp=abs(a+2*n-*aft)+1+abs(b-opp);
ans=min(ans, temp);
}
if(mid!=arr.end() && *mid<=b){
int opp=(*mid+n)%(2*n);
int temp=abs(*mid-a)+1+abs(opp-b);
ans=min(ans, temp);
}
std::cout << ans << "\n";
}
}
