#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=100010;
ll n,m,a[N],b[N],c[N],ans,mod;
int main () {
    freopen("shijian.in","r",stdin);
    freopen("shijian.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin >> n >> m;
    mod=pow(2,32);
    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++) cin >> c[i];
    while (m--) {
        ans=0;
        int l,r;
        cin >> l >> r;
        ll sum1=0,sum2=0,sum3=0;
        for (int i=l;i<=r;i++) {
            for (int j=i;j<=r;j++) {
                sum1=a[i],sum2=b[i],sum3=c[i];
                for (int k=i+1;k<=j;k++) {
                    sum1&=a[k];
                    sum2|=b[k];
                    sum3=__gcd(sum3,c[k]);
                    sum1%=mod,sum2%=mod,sum3%=mod;
                }
                ans=(ans+sum1*sum2%mod*sum3%mod)%mod;
            }
        }
        cout << ans <<"\n";
    }
    return 0;
}