#include <bits/stdc++.h>

using i64 = int64_t;

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

    int n, q;
    std::cin >> n >> q;

    std::vector<int> a(n), b(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n; ++i) {
        std::cin >> b[i];
    }
    a.insert(a.end(), a.begin(), a.end());
    b.insert(b.end(), b.begin(), b.end());

    bool flawed = false;
    for (int i = 0; i < n; ++i) {
        if (a[i] + b[i] < 0) {
            flawed = true;
            break;
        }
    }
    if (std::accumulate(a.begin(), a.end(), 0LL) < 0 ||
        std::accumulate(b.begin(), b.end(), 0LL) < 0) {
            flawed = true;
    }
    if (flawed) {
        for (int i = 0; i < q; ++i) {
            std::cout << "flawed\n";
        }
        return 0;
    }

    std::vector<i64> sa(n * 2), sb(n * 2);
    sa[0] = a[0];
    sb[0] = b[0];
    for (int i = 1; i < sa.size(); ++i) {
        sa[i] = sa[i - 1] + a[i];
        sb[i] = sb[i - 1] + b[i];
    }
    // std::partial_sum(a.begin(), a.end(), sa.begin());
    // std::partial_sum(b.begin(), b.end(), sb.begin());

    while (q--) {
        int s, t;
        std::cin >> s >> t;
        --s, --t;

        if (s == t) {
            std::cout << "0\n";
        } else {
            if (s > t) {
                t += n;
            }
            i64 ans = sa[t - 1] - (s ? sa[s - 1] : i64(0));
            if (s < t) {
                s += n;
            }
            ans = std::min(ans, sb[s - 1] - (t ? sb[t - 1] : i64(0)));
            std::cout << ans << '\n';
        }
    }
}