#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll, ll>;

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n, m, k; cin >> n >> m >> k;
    vector<ll> elso(n), masodik(m);
    for (ll i=0; i<n; i++) cin >> elso[i];
    for (ll i=0; i<m; i++) cin >> masodik[i];
    vector<pll> out(k);
    map<pll, ll> mp;
    for (ll i=0; i<k; i++){
        cin >> out[i].first >> out[i].second; out[i].first--; out[i].second--;
        mp[{out[i].first, out[i].second}]=0;
    }
    vector<pll> dijkstra1(m+1), dijkstra2(m+1);
    dijkstra2[m]={0, 0};
    for (ll i=m-1; i>=0; i--)
        dijkstra2[i]={masodik[i]+dijkstra2[i+1].second, dijkstra2[i+1].first};
    for (ll i=n-1; i>=0; i--){
        for (ll j=m; j>=0; j--){
            if (j==m) dijkstra1[j]={elso[i]+dijkstra2[j].second, dijkstra2[j].first};
            else{
                dijkstra1[j]={elso[i]+masodik[j]+dijkstra2[j+1].second, dijkstra2[j+1].first};
                if (elso[i]+dijkstra2[j].second>dijkstra1[j].first) dijkstra1[j]={elso[i]+dijkstra2[j].second, dijkstra2[j].first};
                if (masodik[j]+dijkstra1[j+1].second>dijkstra1[j].first) dijkstra1[j]={masodik[j]+dijkstra1[j+1].second, dijkstra1[j+1].first};
            }
            if (mp.find({i, j})!=mp.end()) mp[{i, j}]=dijkstra1[j].first;
        }
        dijkstra2=dijkstra1;
    }
    for (auto& z:out) cout << mp[z] << '\n';
}