#include <bits/stdc++.h>
using namespace std;
long long n, mod;
long long calc(long long x, long long l, long long r, long long u, long long v,
               long long &cnt) {
  u = max(u, 1ll);
  v = min(x, v);
  if (l > x || r < 1 || u > x || v < 1) return 0;
  if (l == 1 && r == x) {
    cnt = v - u + 1;
    long long q = u + v;
    long long res;
    if (q % 2 == 0)
      res = (((q / 2) % mod) * (cnt % mod)) % mod;
    else
      res = (((cnt / 2) % mod) * (q % mod)) % mod;
    cnt %= mod;
    return res;
  }
  long long res1, res2;
  long long a = (x + 1) / 2;
  long long c1 = 0, c2 = 0;
  res1 = calc(a, l, min(a, r), (u + 2) / 2, (v + 1) / 2, c1);
  res2 = 2 * calc(x - a, max(l, a + 1) - a, r - a, (u + 1) / 2, (v) / 2, c2);
  res1 = 2 * res1 - c1;
  cnt = (c1 + c2) % mod;
  res1 %= mod;
  res2 %= mod;
  return ((res1 + res2) % mod + mod) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  int m;
  cin >> n >> m >> mod;
  for (int i = 0; i < m; i++) {
    long long l, r, u, v;
    cin >> l >> r >> u >> v;
    long long cnt = 0;
    long long ans = calc(n, l, r, u, v, cnt);
    cout << ans << endl;
  }
  return 0;
}
