#include <bits/stdc++.h>
using namespace std;

const int N = 500010;
const long long MOD = 4294967296;
int n, m, a[N], b[N], c[N], l, r;
long long ans, cnt, tot, sum;

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;
    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--) {
        cin >> l >> r;
        sum = 0;
        for (int i = l; i <= r; i++) {
            for (int j = i; j <= r; j++) {
                ans = a[i], cnt = b[i], tot = c[i];
                for (int k = i; k <= j; k++) {
                    ans &= a[k];
                    cnt |= b[k];
                    tot = __gcd(tot, (long long)c[k]);
                }
                sum += (ans * cnt % MOD * tot % MOD);
            }
        }
        cout << sum << "\n";
    }
    return 0;
}