#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define Shahriyor ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vc vector<char>
#define vs vector<string>
#define vp vector<pair<int,int>>
#define vvp vector<vector<pair<int,int>>>
#define all(x) (x).begin(), (x).end()
#define allr(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define endl '\n'
#define len(a) (int)(a).length()
#define inf 4e18
#define print(x) { cout << x << endl; return; }
void Solve();
int mod = 1e9+7;
int LOG = 20;
vi dx = {-1, 1, 0, 0, 1, -1, 1, -1};
vi dy = {0, 0, 1, -1, 1, -1, -1, 1};
ostream& operator<<(ostream& out, vi& a) {
for(int i=0;i<sz(a);i++) out << a[i] << ' ';
return out;
}
istream& operator>>(istream& in, vi& a) {
for(int i=0;i<sz(a);i++) in >> a[i];
return in;
}
int sum(vi& l) {return accumulate(all(l),(int)0);}
int binpow(int a, int b){
int res = 1;
while(b){
if(b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
signed main(){
clock_t start = clock();
Shahriyor;
#ifndef ONLINE_JUDGE
freopen("i.txt","r",stdin), freopen("o.txt","w",stdout);
#endif
int t = 1;
// cin >> t;
while(t--) Solve();
cerr << "Time: " << double(clock() - start) / double(CLOCKS_PER_SEC) * 1000 << " ms\n";
}
int n,m,q;
int dist(int a,int b){
return min(abs(a-b),2*n-abs(a-b));
}
int res(int a,int b,vi& l){
int ans=min(abs(a-b),2*n-abs(a-b));
int x=-1,y=-1,z=-1;
auto low=lower_bound(all(l),a);
if(low!=l.end() && *low==a) y=*low;
if(low!=l.begin()) x=*(prev(low));
auto high=upper_bound(all(l),a);
if(high!=l.end()) z=*high;
if(x!=-1){
if(x+n<2*n) ans=min(ans,1+dist(a,x)+dist(x+n,b));
else ans=min(ans,1+dist(a,x)+dist(x-n,b));
}
if(y!=-1){
if(y+n<2*n) ans=min(ans,1+dist(a,y)+dist(y+n,b));
else ans=min(ans,1+dist(a,y)+dist(y-n,b));
}
if(z!=-1){
if(z+n<2*n) ans=min(ans,1+dist(a,z)+dist(z+n,b));
else ans=min(ans,1+dist(a,z)+dist(z-n,b));
}
return ans;
}
void Solve(){
cin>>n>>m>>q;
vi l;
for(int i=0;i<m;i++){
int a; cin>>a;
l.push_back(a);
l.push_back(a+n);
}
sort(all(l));
while(q--){
int a,b; cin>>a>>b;
cout << min(res(a,b,l),res(b,a,l)) << endl;
}
}
