codeforces.contest/835/problem/C（三维前缀和）

 Star sky

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).

Over time the stars twinkle. At moment 0 the i-th star has brightness si. Let at moment t some star has brightness x. Then at moment(t + 1) this star will have brightness x + 1, if x + 1 ≤ c, and 0, otherwise.

You want to look at the sky q times. In the i-th time you will look at the moment ti and you will see a rectangle with sides parallel to the coordinate axes, the lower left corner has coordinates (x1i, y1i) and the upper right — (x2i, y2i). For each view, you want to know the total brightness of the stars lying in the viewed rectangle.

A star lies in a rectangle if it lies on its border or lies strictly inside it.

Input

The first line contains three integers n, q, c (1 ≤ n, q ≤ 105, 1 ≤ c ≤ 10) — the number of the stars, the number of the views and the maximum brightness of the stars.

The next n lines contain the stars description. The i-th from these lines contains three integers xi, yi, si (1 ≤ xi, yi ≤ 100,0 ≤ si ≤ c ≤ 10) — the coordinates of i-th star and its initial brightness.

The next q lines contain the views description. The i-th from these lines contains five integers ti, x1i, y1i, x2i, y2i (0 ≤ ti ≤ 109,1 ≤ x1i < x2i ≤ 100, 1 ≤ y1i < y2i ≤ 100) — the moment of the i-th view and the coordinates of the viewed rectangle.

Output

For each view print the total brightness of the viewed stars.

Examples

input

2 3 3
1 1 1
3 2 0
2 1 1 2 2
0 2 1 4 5
5 1 1 5 5

output

3
0
3

input

3 4 5
1 1 2
2 3 0
3 3 1
0 1 1 100 100
1 2 2 4 4
2 2 1 4 7
1 50 50 51 51

output

3
3
5
0

Note

Let's consider the first example.

At the first view, you can see only the first star. At moment 2 its brightness is 3, so the answer is 3.

At the second view, you can see only the second star. At moment 0 its brightness is 0, so the answer is 0.

At the third view, you can see both stars. At moment 5 brightness of the first is 2, and brightness of the second is 1, so the answer is 3.

因为给的范围比较小所以想到了前缀和，但是没法处理时间。。。但是时间范围也比较小，再加一维就可以处理了

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+7;
typedef  long long LL;
int dp[110][110][14];

int main()
{
    int n, q, c;
    scanf("%d %d %d", &n, &q, &c);
    memset(dp,0,sizeof(dp));
    for(int i=0;i<n;i++)
    {
        int x, y, z;
        scanf("%d %d %d", &x, &y, &z);
        for(int j=0;j<=12;j++)
        {
            int s=(z+j)%(c+1);
            dp[y][x][j]+=s;
        }
    }
    for(int i=1;i<=100;i++)
        for(int j=1;j<=100;j++)
            for(int k=0;k<=13;k++)
                dp[i][j][k]+=(dp[i-1][j][k]+dp[i][j-1][k]-dp[i-1][j-1][k]);

    while(q--)
    {
        int t, x1, y1, x2, y2;
        scanf("%d %d %d %d %d", &t, &x1, &y1, &x2, &y2);
        t=t%(c+1);
        printf("%d\n",dp[y2][x2][t]-dp[y2][x1-1][t]-dp[y1-1][x2][t]+dp[y1-1][x1-1][t]);
    }
    return 0;
}