#include <bits/stdc++.h>
using namespace std;
long long mod;
long long get(long long n, long long m, long long r) {
  if (n == 0) return 0;
  if (n % 2 == 0) {
    m %= mod;
    m *= ((n - 1) % mod);
    m %= mod;
    m += (2LL * r) % mod;
    m %= mod;
    n /= 2;
    n %= mod;
    return (n * m) % mod;
  } else {
    long long tmp = n;
    tmp %= mod;
    n = (n - 1) / 2;
    n %= mod;
    n *= (m % mod);
    n %= mod;
    n += (r % mod);
    n %= mod;
    return (n * tmp) % mod;
  }
}
pair<long long, long long> func(long long n, long long len, long long m,
                                long long r, long long a, long long b) {
  if (len == 0) return {0, 0};
  if (n == 1 && len == 1) {
    if (r <= b && r > a)
      return {(r) % mod, 1};
    else
      return {0, 0};
  }
  if ((n + 1) / 2 >= len) return func((n + 1) / 2, len, 2LL * m, r, a, b);
  long long cntr, cntl, cnt = 0;
  if (b < r)
    cntr = 0;
  else
    cntr = min((n + 1) / 2, (b - r) / (2LL * m) + 1);
  if (a < r)
    cntl = 0;
  else
    cntl = min((n + 1) / 2, (a - r) / (2LL * m) + 1);
  cnt += cntr - cntl;
  cnt %= mod;
  long long ans = get(cntr, 2LL * m, r) + mod - get(cntl, 2LL * m, r);
  ans %= mod;
  pair<long long, long long> X =
      func(n / 2, len - (n + 1) / 2, 2LL * m, m + r, a, b);
  ans += X.first;
  ans %= mod;
  cnt += X.second;
  cnt %= mod;
  return {ans, cnt};
}
int main() {
  long long n, q;
  cin >> n >> q >> mod;
  for (int i = 0; i < q; i++) {
    long long l, r, u, v;
    cin >> l >> r >> u >> v;
    v--;
    u--;
    pair<long long, long long> X1 = func(n, r, 1, 0, u - 1, v);
    pair<long long, long long> X2 = func(n, l - 1, 1, 0, u - 1, v);
    long long ans = X1.first + X1.second + 2LL * mod - X2.first - X2.second;
    ans %= mod;
    cout << ans << '\n';
  }
}
