#include <bits/stdc++.h>
using namespace std;
long long n, m, p, a, b, h;
long long rev(long long n) {
  int i;
  long long r;
  for (r = 0, i = 0; i < p; r = r * 2 + (n & 1), n >>= 1, i++)
    ;
  return r;
}
long long sm(long long f, long long d) {
  long long x = a, y = b;
  if (y < f) return 0;
  if (x < f) x = f;
  if ((x - f) % d) x += d - (x - f) % d;
  if ((y - f) % d) y -= (y - f) % d;
  if (x > y) return 0;
  if ((x + y) % 2 == 0)
    return ((x + y) / 2 % m * (((y - x) / d + 1) % m) + (y - x) / d + 1) % m;
  else
    return (((y - x) / d + 1) / 2 % m * ((x + y) % m) + (y - x) / d + 1) % m;
}
long long gt(long long i, long long j, long long l, long long r) {
  if (i > r || j < l) return 0;
  if (l >= i && r <= j) return sm(rev(l), h / (r - l + 1));
  return (gt(i, j, l, (l + r) / 2) + gt(i, j, (l + r) / 2 + 1, r)) % m;
}
long long pos(long long a, long long n, long long d) {
  if (n == 1) return 0;
  if (a >= (n + 1) / 2)
    return pos(a - (n + 1) / 2, n - (n + 1) / 2, 2 * d) + d;
  else
    return pos(a, (n + 1) / 2, 2 * d);
}
int main() {
  long long q, i, j;
  scanf("%I64d%I64d%I64d", &n, &q, &m);
  for (p = 0, h = 1; h < n; p++, h *= 2)
    ;
  for (; q--;) {
    scanf("%I64d%I64d%I64d%I64d", &i, &j, &a, &b);
    i--;
    j--;
    a--;
    b--;
    if (a > n - 1 || i > n - 1)
      printf("0\n");
    else {
      if (b > n - 1) b = n - 1;
      if (j > n - 1) j = n - 1;
      i = rev(pos(i, n, 1));
      j = rev(pos(j, n, 1));
      printf("%I64d\n", gt(i, j, 0, h - 1));
    }
  }
  return 0;
}
