#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=2e5+5;
ll a[N],b[N];
int main()
{
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=n;i++)
        cin>>b[i];
    for(int i=1;i<=n;i++)
        if(a[i]+b[i]<0)
        {
            while(q--)
                cout<<"flawed"<<endl;
            return 0;
        }
    for(int i=1;i<=n;i++)
    {
        a[i]+=a[i-1];
        b[i]+=b[i-1];
    }
    while(q--)
    {
        int s,t;
        cin>>s>>t;
        if(s==t)cout<<0<<endl;
        if(s<t)
        {
            ll res1=a[t-1]-a[s-1];
            ll res2=b[s-1]+b[n]-b[t-1];
            cout<<min(res1,res2)<<endl;
        }
        if(s>t)
        {
            ll res1=b[s-1]-b[t-1];
            ll res2=a[n]-a[s-1]+a[t-1];
            cout<<min(res1,res2)<<endl;
        }
    }
    return 0;
}