#include<cstdio>
#define reg 
int n,q;
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
// #define meow(args...) fprintf(stderr,args)
long long a[400002],b[400002];
int main()
{
    scanf("%d%d",&n,&q);
    long long sum=0;
    bool flag=0;
    for(reg int i=1;i<=n;++i)
    {
        scanf("%lld",a+i);
        sum+=a[i];
        a[i+n]=a[i];
    }
    if(sum<0) flag=1;
    sum=0;
    for(reg int i=1;i<=n;++i)
    {
        scanf("%lld",b+i);
        sum+=b[i];
        b[i+n]=b[i];
        if(a[i]+b[i]<0) flag=1;
    }
    if(sum<0) flag=1;
    if(flag)
    {
        while(q--)
        {
            printf("flawed\n");
        }
        return 0;
    }
    for(reg int i=2;i<=n+n;++i)
    {
        a[i]+=a[i-1];
        b[i]+=b[i-1];
    }
    while(q--)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        if(x==y) printf("0\n");
        else if(x<y)
        {
            printf("%lld\n",min(a[y-1]+a[x-1],b[x+n-1]-b[y-1]));
            // meow("x<y %lld %lld\n",a[y-1]+a[x-1],b[x+n-1]-b[y-1]);
        }
        else 
        {
            printf("%lld\n",min(b[x-1]-b[y-1],a[y+n-1]-a[x-1]));
            // meow("x>y %lld %lld\n",b[x-1]-b[y-1],a[y+n-1]-a[x-1]);
        }
    }
    return 0;
}