#include <bits/stdc++.h>
using ll = long long;

int main() {
  std::cin.tie(0)->sync_with_stdio(0);
  int n, m;
  std::cin >> n >> m;
  std::vector<ll> a(n), b(n), c(n), ca(n), cb(n), cc(n);
  std::vector<std::valarray<ll>> v1(n, {0, 0}), v2(n, {0, 0});
  std::vector<ll> ans(m);
  std::vector<std::vector<std::pair<int, int>>> qu(n);
  for (ll &x : a) std::cin >> x;
  for (ll &x : b) std::cin >> x;
  for (ll &x : c) std::cin >> x;
  for (int i = 0; i < m; i++) {
    int l, r;
    std::cin >> l >> r;
    l--, r--;
    qu[r].emplace_back(l, i);
  }
  for (int i = 0; i < n; i++) {
    ca[i] = a[i], cb[i] = b[i], cc[i] = c[i];
    v1[i][0] -= (a[i] * b[i] * c[i] - v1[i][1]) * (i - 1), v1[i][1] = a[i] * b[i] * c[i];
    
    for (int j = i - 1; j >= -1; j--) {
      if (j < 0 || ((ca[j] & a[i]) == ca[j] && (cb[j] | b[i]) == cb[j] && std::__gcd(cc[j], c[i]) == cc[j])) {
        for (int k = j + 1; k <= i; k++) {
          // if (i == 1) std::
          v2[k] = k ? v1[k] + v2[k - 1] : v1[k];
        }
        break;
      }
      ca[j] &= a[i], cb[j] |= b[i], cc[j] = std::__gcd(cc[j], c[i]);
      // if (i == 1) std::cerr << ca[j] << ' ' << cb[j] << ' ' << cc[j] << '\n';
      v1[j][0] -= (ca[j] * cb[j] * cc[j] - v1[j][1]) * (i - 1), v1[j][1] = ca[j] * cb[j] * cc[j];
    }
    // if (i == 1) cpp_dump(i, v2[1]);
    for (auto [l, id] : qu[i]) {
      ans[id] = v2[i][0] + v2[i][1] * i;
      if (l) ans[id] -= v2[l - 1][0] + v2[l - 1][1] * i;
    }
  }
  for (ll x : ans) std::cout << x << '\n';
}