#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int n, m, q;
int dist(int i, int j) {
return min(abs(i-j), 2*n-abs(i-j));
}
signed main() {
cin.tie(nullptr); cout.tie(nullptr);
ios_base::sync_with_stdio(false);
cin >> n >> m >> q;
int pairs[m];
for (int i = 0; i < m; i++) {
cin >> pairs[i];
}
for (int i = 0; i < q; i++) {
int a, b;
cin >> a >> b;
int ans = dist(a, b);
for (int j = 0; j < m; j++) {
ans = min(ans, dist(a, pairs[j]) + dist(b, (pairs[j]+n)%(2*n)) + 1);
ans = min(ans, dist(b, pairs[j]) + dist(a, (pairs[j]+n)%(2*n)) + 1);
}
cout << ans << endl;
}
cout.flush();
return 0;
}
