#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=4294967296;
int tu[1005][1005];
int fa[20005][20],fb[20005][20],fc[20005][20];//区间长度以后记得计算 
signed main(){
    freopen("shijian.in","r",stdin);
    freopen("shijian.out","w",stdout);
    int n,m;
    scanf("%lld%lld",&n,&m);
    for(int i = 1;i<=n;i++){
        cin>>fa[i][0];
    }
    for(int i = 1;i<=n;i++){
        cin>>fb[i][0];
    }
    for(int i = 1;i<=n;i++){
        cin>>fc[i][0];
    }
    for(int j = 1;j<=19;j++){
        for(int i = 1;i<=n-(1<<j)+1;i++){
            fa[i][j]=(fa[i][j-1]&fa[i+(1<<(j-1))][j-1]);
            fb[i][j]=(fb[i][j-1]|fb[i+(1<<(j-1))][j-1]);
            fc[i][j]=__gcd(fc[i][j-1],fc[i+(1<<(j-1))][j-1]);
        }
    }
    for(int i = 1;i<=n;i++){
        for(int j = i;j<=n;j++){
            int k=log2(j-i+1);
            tu[i][j]=(fa[i][k]&fa[j-(1<<k)+1][k]) * (fb[i][k]|fb[j-(1<<k)+1][k]) * __gcd(fc[i][k],fc[j-(1<<k)+1][k]);
        }
    }
    
    for(int i = 1;i<=n;i++){
        
        for(int j = 1;j<=n;j++){
            tu[i][j]+=tu[i-1][j]+tu[i][j-1]-tu[i-1][j-1];
            //tu[i][j]%=mod;
            
        }
       
    }
    for(int i = 1;i<=m;i++){
        int l,r;
        cin>>l>>r;
        printf("%lld\n",(tu[r][r]-tu[l-1][r])%mod);
    }
    
    
    return 0;
}