#include <bits/stdc++.h>
using namespace std;
#define fori(x, y) for (int i=(x);i<=(y);++i)
#define forj(x, y) for (int j=(x);j<=(y);++j)
#define fork(x, y) for (int k=(x);k<=(y);++k)
const int N = 1e6 +10;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define debug(x) cerr << #x << " = " << x << endl
int a[N];
int b[N];
int prea[N],preb[N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,q;
    cin>>n>>q;
    int flag = 0;
    for(int i = 1;i<=n;i++){
        cin>>a[i];
        prea[i] = prea[i-1]+a[i];
    }
    for(int i = 1;i<=n;i++){
        a[i+n] = a[i];
        prea[i+n] = prea[i+n-1]+a[i+n];
    }
    for(int i = 1;i<=n;i++){
        cin>>b[i];
        preb[i] = preb[i-1]+b[i];
    }
    for(int i = 1;i<=n;i++){
        b[i+n] = b[i];
        if(b[i]+a[i]<0){
            flag = 1;
        }
        preb[i+n] = preb[i+n-1]+b[i+n];
    }
    if(prea[n]<0 || preb[n]<0) flag = 1;
    int s,t;
    while(q--){
        cin>>s>>t;
        if(flag){
            cout<<"flawed"<<'\n';
            continue;
        }
        if(s==t){
            cout<<0<<'\n';
            continue;
        }
        if(s<t){
            int minn = prea[t-1] - prea[s-1]; 
            minn = min(minn,preb[s+n-1]- preb[t-1]);
            cout<<minn<<'\n';
            continue;
        }
        int minn = prea[t+n-1] - prea[s-1];
        minn = min(minn,preb[s-1] - preb[t-1]);
        cout<<minn<<'\n';

    }



    
    return 0;
}