#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
int n,m,q;
int dist(int a,int b)
{
return min(abs(a-b),2*n-abs(a-b));
}
void solve()
{
cin >> n >> m >> q;
set<int> good;
rep(i,m)
{
int a;
cin >> a;
good.insert(a);
good.insert(a+n);
}
rep(i,q)
{
int a,b;
cin >> a >> b;
if(a > b) swap(a,b);
int l = -1;
int r = -1;
auto it1 = good.upper_bound(a);
if(it1 != good.begin())
{
it1--;
l = (*it1)%(n*2);
}
else
{
it1 = good.end();
it1--;
l = (*it1)%(n*2);
}
it1 = good.lower_bound(a);
if(it1 != good.end())
{
r = (*it1)%(n*2);
}
else
{
it1 = good.begin();
r = (*it1)%(n*2);
}
int m1 = dist(a,b);
int m2 = dist(a,l) + dist((l+n) % (n*2),b)+1;
int m3 = dist(a,r) + dist((r+n) % (n*2),b)+1;
// cout << m1 << " " << m2 << " " << m3 << " " << l << " " << r << " m\n";
cout << min(min(m1,m2),m3) << "\n";
}
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random();
int t = 1;
// cin >> t;
while(t--) solve();
}
