// #pragma GCC optimizer("Ofast")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
#define int long long 
#define ld long double
#define ull unsigned long long 
#define fr first
#define fi first
#define sc second
#define se second
#define all(x) x.begin(), x.end()
#define pii pair<int,int>
//#define sz(x) (int)x.size()
using namespace std;

#ifndef fireball
#define tofu ios::sync_with_stdio(0); cin.tie(0);
#else
#define tofu freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#endif 

void db() {cout << '\n';}
template <typename T, typename ...U> void db(T a, U ...b) {cout << a << ' ', db(b...);}

signed main(){
    tofu;
    int n, q; cin >> n >> q;
    vector<int> l(n + 1, 0), r(n + 1, 0);
    for(int i = 1; i <= n; ++i) cin >> r[i];
    for(int i = 1; i <= n; ++i){
        if(i < n) cin >> l[i + 1];
        else cin >> l[1];
    }

    int yes = 0, sum_l = 0, sum_r = 0;
    for(int i = 1; i <= n; ++i){
        int x;
        if(i < n) x = r[i] + l[i + 1];
        else x = r[i] + l[1];
        if(x < 0) yes = 1;

        sum_l += l[i];
        sum_r += r[i];
    }
    if(sum_l < 0 or sum_r < 0) yes = 1;

    vector<int> pre(2 * n + 1, 0), suf(2 * n + 2, 0);
    for(int i = 1; i <= 2 * n; ++i){
        if(i <= n) pre[i] = pre[i - 1] + r[i];
        else pre[i] = pre[i - 1] + r[i - n];
    }
    for(int i = 2 * n; i > 0; --i){
        if(i > n) suf[i] = suf[i + 1] + l[i - n];
        else suf[i] = suf[i + 1] + l[i];
    }

    // for(int i = 1; i <= 2 * n; ++i) cout << pre[i] << ' ';
    // db();   
    // for(int i = 1; i <= 2 * n; ++i) cout << suf[i] << ' ';
    // db();


    while(q--){
        int st, ed; cin >> st >> ed;
        if(yes){
            db("flawed");
            continue;
        }

        int ans;
        if(st <= ed){
            ans = min(pre[ed - 1] - pre[st - 1], suf[ed + 1] - suf[st + n + 1]);
        }
        else{
            ans = min(pre[ed + n - 1] - pre[st - 1], suf[ed + 1] - suf[st + 1]);
        }
        db(ans);

    }
}