#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>

struct Elsok {
    int i, j;
};

using Szamsor = std::vector<int>;
using Jatszmak = std::vector<Elsok>;

void beolvas(Szamsor &s1, Szamsor &s2, Jatszmak &jatszmak, std::istream &be = std::cin) {
    int n, m, k;
    be >> n >> m >> k;

    s1.resize(n);
    for (auto &x : s1) {
        be >> x;
    }

    s2.resize(m);
    for (auto &x : s2) {
        be >> x;
    }

    jatszmak.resize(k);
    for (auto &[i, j] : jatszmak) {
        be >> i >> j;
    }
}

void max_pontszam_dp_bottom_up(Szamsor &s1, Szamsor &s2, const Jatszmak &jatszmak) {
    const int n = s1.size();
    const int m = s2.size();
    std::vector<std::vector<int>> dp(n + 1, std::vector<int>(m + 1));

    for (int i = n - 2; i >= 0; i--) {
        s1[i] += s1[i + 1];
    }

    for (int j = m - 2; j >= 0; j--) {
        s2[j] += s2[j + 1];
    }

    dp[n][m] = 0;

    for (int i = n - 1; i >= 0; i--) {
        dp[i][m] = s1[i] - dp[i + 1][m];
    }

    for (int j = m - 1; j >= 0; j--) {
        dp[n][j] = s2[j] - dp[n][j + 1];
    }

    for (int i = n - 1; i >= 0; i--) {
        for (int j = m - 1; j >= 0; j--) {
            dp[i][j] = s1[i] + s2[j] - std::min({ dp[i + 1][j], dp[i][j + 1], dp[i + 1][j + 1] });
        }
    }

    for (const auto [i, j] : jatszmak) {
        std::cout << dp[i - 1][j - 1] << '\n';
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    Szamsor s1, s2;
    Jatszmak jatszmak;
    beolvas(s1, s2, jatszmak);

    max_pontszam_dp_bottom_up(s1, s2, jatszmak);

    return 0;
}