#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 1e5+7;
int a[N], b[N];
struct State {
int x, y, t;
int val() {
if (t&1)
return a[x];
else
return b[y];
};
bool operator <(State s) {
return val() < s.val();
}
};
struct SegTree {
int mx[N << 2];
void build(int v, int tl, int tr, int a[N]) {
if (tl == tr) {
mx[v] = a[tl];
return;
}
int tm = (tl + tr) >> 1;
build(v * 2 + 1, tl, tm, a);
build(v * 2 + 2, tm + 1, tr, a);
mx[v] = max(mx[v * 2 + 1], mx[v * 2 + 2]);
}
int getl(int v, int tl, int tr, int l, int r, int x) {
if (mx[v] <= x || tr < l || r < tl)
return -1;
if (tl == tr)
return tl;
int tm = (tl + tr) >> 1;
int t = getl(v * 2 + 1, tl, tm, l, r, x);
if (t != -1)
return t;
return getl(v * 2 + 2, tm + 1, tr, l, r, x);
}
int getr(int v, int tl, int tr, int l, int r, int x) {
if (mx[v] <= x || tr < l || r < tl)
return -1;
if (tl == tr)
return tl;
int tm = (tl + tr) >> 1;
int t = getr(v * 2 + 2, tm + 1, tr, l, r, x);
if (t != -1)
return t;
return getr(v * 2 + 1, tl, tm, l, r, x);
}
} dx, dy;
int n, m, q;
map <int, int> dp[4][N];
int get(int x, int y, int t) {
if (x < 0 || x >= n || y < 0 || y >= m)
return -1;
if (dp[t][x].find(y) != dp[t][x].end())
return dp[t][x][y];
int &d = dp[t][x][y];
d = 0;
if (t&1) {
if (t == 1) {
int to = dy.getl(0, 0, m - 1, y, m - 1, a[x]);
if (to == -1) {
d = m - 1 - y;
}
else {
d = max(d, get(x, to, 0));
d = max(d, get(x, to, 2));
d += to - y;
}
}
else {
int to = dy.getr(0, 0, m - 1, 0, y, a[x]);
if (to == -1) {
d = y;
}
else {
d = max(d, get(x, to, 0));
d = max(d, get(x, to, 2));
d += y - to;
}
}
}
else {
if (t == 2) {
int to = dx.getl(0, 0, n - 1, x, n - 1, b[y]);
if (to == -1) {
d = n - 1 - x;
}
else {
d = max(d, get(to, y, 1));
d = max(d, get(to, y, 3));
d += abs(x-to);
}
}
else {
int to = dx.getr(0, 0, n - 1, 0, x, b[y]);
if (to == -1) {
d = x;
}
else {
d = max(d, get(to, y, 1));
d = max(d, get(to, y, 3));
d += abs(x-to);
}
}
}
return d;
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
cin >> n >> m >> q;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < m; ++i)
cin >> b[i];
dx.build(0, 0, n - 1, a);
dy.build(0, 0, m - 1, b);
while (q--) {
int x, y;
cin >> x >> y;
--x; --y;
int ans = 0;
ans = max(ans, get(x-1,y,0)+1);
ans = max(ans, get(x+1,y,2)+1);
ans = max(ans, get(x,y-1,3)+1);
ans = max(ans, get(x,y+1,1)+1);
cout << ans << endl;
}
}
