// Problem: P9335 [Ynoi2001] 雪に咲く花
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P9335
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define scd second
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

namespace IO {
    char ibuf[(1 << 20) + 1], *iS, *iT, obuf[(1 << 20) + 1], *oS = obuf;
#define writesp(x) write(x), pc(' ')
#define writeln(x) write(x), pc('\n')
#define gh() (iS == iT ? iT = (iS = ibuf) + fread(ibuf, 1, (1 << 20) + 1, stdin), (iS == iT ? EOF : *iS++) : *iS++)
    inline uint read() {
        char ch = gh();
        uint x = 0;
        while (ch < '0' || ch > '9') ch = gh();
        while (ch >= '0' && ch <= '9') x = (x << 1) + (x << 3) + (ch ^ 48), ch = gh();
        return x;
    }
    inline void flush () {
    	fwrite(obuf, 1, oS - obuf, stdout), oS = obuf;
	}
    inline void pc (char ch) {
    	if (oS == obuf + (1 << 20) + 1) flush(); 
    	*oS++ = ch;
	}
	template<typename _Tp>
    inline void write (_Tp x) {
    	static char stk[64], *tp = stk;
		do *tp++ = x % 10, x /= 10;
		while (x);
		while (tp != stk) pc((*--tp) | 48);
    }
}

using IO::read;
using IO::write;
using IO::pc;
using IO::flush;

const int maxn = 1000100;
const int maxm = 5000100;

int n, m, t, d[maxn], id[maxm], L[maxm], R[maxm];
uint ans[maxm], a[maxn], b[maxn], c[maxn], f[maxn], g[maxn], h[maxn];

void solve() {
    n = read();
    m = read();
    for (int i = 1; i <= n; ++i) {
    	a[i] = read();
    }
    for (int i = 1; i <= n; ++i) {
    	b[i] = read();
    }
    for (int i = 1; i <= n; ++i) {
    	c[i] = read();
    }
    for (int i = 1, l, r; i <= m; ++i) {
    	l = read();
    	r = read();
    	L[i] = l;
    	R[i] = r;
    	++d[r];
    }
    int s = 0;
    for (int i = 1; i <= n; ++i) {
    	s += d[i];
    	d[i] = s - d[i];
    }
    for (int i = 1; i <= m; ++i) {
    	id[++d[R[i]]] = i;
    }
    for (int i = 1, k = 1; i <= n; ++i) {
    	int j = i - 1;
    	while (j) {
    		uint x = a[j] & a[j + 1], y = b[j] | b[j + 1], z = __gcd(c[j], c[j + 1]);
    		if ((x ^ a[j]) || (y ^ b[j]) || (z ^ c[j])) {
    			a[j] = x;
    			b[j] = y;
    			c[j] = z;
    			--j;
    		} else {
    			break;
    		}
    	}
    	f[i] = f[i - 1] + g[i - 1] * (t - h[i - 1]);
    	uint x = g[j];
    	++j;
    	while (j <= i) {
    		f[j] += g[j] * (t - h[j]);
    		g[j] = (x += a[j] * b[j] * c[j]);
    		h[j] = t;
    		++j;
    	}
    	++t;
    	uint p = f[i] + g[i] * (t - h[i]);
    	while (k <= d[i]) {
    		int o = id[k];
    		int l = L[o];
    		ans[o] = p - (f[l - 1] + g[l - 1] * (t - h[l - 1]));
    		++k;
    	}
    }
    for (int i = 1; i <= m; ++i) {
    	writeln(ans[i]);
    }
    flush();
}

int main() {
    int T = 1;
    // scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}