#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
long long int POWER[65];
long long int aonb(long long int a, long long int b) {
  long long int ret = 1;
  while (b) {
    if (b & 1) ret *= a;
    a *= a;
    if (ret >= MOD) ret %= MOD;
    if (a >= MOD) a %= MOD;
    b >>= 1;
  }
  return ret;
}
void precompute() {
  POWER[0] = 1;
  for (int i = 1; i < 63; i++) POWER[i] = POWER[i - 1] << 1LL;
}
long long int dp[11][101][101];
int main() {
  long long int A[101][101];
  int count[101][101];
  for (int i = 0; i < 101; i++) {
    for (int j = 0; j < 101; j++) {
      A[i][j] = 0;
      count[i][j] = 0;
    }
  }
  int n, que, c;
  int x, y, b;
  scanf("%d %d %d", &n, &que, &c);
  for (int i = 0; i < n; i++) {
    scanf("%d %d %d", &x, &y, &b);
    A[x][y] += b;
    count[x][y]++;
    dp[0][x][y] += b;
    for (int ch = 1; ch <= c; ch++) {
      b = (b + 1) % (c + 1);
      dp[ch][x][y] += b;
    }
  }
  for (int ch = 0; ch <= c; ch++) {
    for (int i = 1; i < 101; i++) {
      for (int j = 1; j < 101; j++) {
        dp[ch][i][j] +=
            dp[ch][i - 1][j] + dp[ch][i][j - 1] - dp[ch][i - 1][j - 1];
      }
    }
  }
  long long int t;
  int p, q;
  long long int ans;
  while (que--) {
    scanf("%lld %d %d %d %d", &t, &x, &y, &p, &q);
    t = t % (c + 1);
    ans = dp[t][p][q];
    if (y > 1) ans -= dp[t][p][y - 1];
    if (x > 1) ans -= dp[t][x - 1][q];
    if (x > 1 && y > 1) ans += dp[t][x - 1][y - 1];
    printf("%lld\n", ans);
  }
  return 0;
}
