#include <bits/stdc++.h>
using namespace std;
long long n, u, v, l, r, pow2[70];
int m, bigp, ans;
void search(long long nownum, int depth, long long l, long long r,
            long long left, long long right) {
  long long mid = (left + right) / 2;
  if ((left == l) && (right == r)) {
    long long u1 = u - nownum, v1 = v - nownum;
    if (u1 < 0) u1 = 0;
    if (v1 < u1) return;
    if (u1 != 0) u1 = (u1 - 1) / pow2[depth] + 1;
    v1 = v1 / pow2[depth];
    long long c1 = u1 + v1, c2 = v1 - u1 + 1;
    if (c1 % 2 == 0)
      c1 /= 2;
    else
      c2 /= 2;
    c1 %= bigp, c2 %= bigp;
    ans = ((long long)ans +
           ((long long)c1 * c2 % bigp) * (long long)(pow2[depth] % bigp) +
           (long long)(v1 - u1 + 1) * (nownum + 1) % bigp) %
          bigp;
  } else {
    if (l <= mid) search(nownum, depth + 1, l, min(r, mid), left, mid);
    if (r >= mid + 1)
      search(nownum + pow2[depth], depth + 1, max(l, mid + 1), r, mid + 1,
             right);
  }
}
int main() {
  pow2[0] = 1;
  for (int i = 1; i <= 62; i++) pow2[i] = pow2[i - 1] * 2;
  scanf("%I64d %d %d", &n, &m, &bigp);
  for (int i = 1; i <= m; i++) {
    scanf("%I64d %I64d %I64d %I64d", &l, &r, &u, &v);
    if (u > n)
      ans = 0;
    else {
      if (v > n) v = n;
      --u, --v;
      ans = 0;
      search(0, 0, l, r, 1, n);
    }
    printf("%d\n", ans);
  }
  return 0;
}
