C. Star sky----容斥

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

题目链接：http://codeforces.com/contest/835/problem/C

题目的意思是说有n个星星，且亮度是周期闪烁，q次询问，问星星亮度的总和。

这个题想的还挺复杂，第一反应是二维线段树，第二反应是离散化，然后是dp，然后就是容斥，想到容斥这个题就很简单了。因为数据量小，直接暴力。

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
struct node{
    int t,x1,y1,x2,y2;
}xin[100010];
int a[100010],b[100010],s[100010];
int sum[11][101][101],zhouqi[101][101];
int main(){
    int n,q,c;
    scanf("%d%d%d",&n,&q,&c);
    for (int i=1;i<=n;i++){
        scanf("%d%d%d",&a[i],&b[i],&s[i]);
    }
    for (int i=0;i<q;i++){
        scanf("%d%d%d%d%d",&xin[i].t,&xin[i].x1,&xin[i].y1,&xin[i].x2,&xin[i].y2);
    }
    memset(sum,0,sizeof(sum));
    for (int i=0;i<=c;i++){
        memset(zhouqi,0,sizeof(zhouqi));
        for (int j=1;j<=n;j++){
            zhouqi[a[j]][b[j]]+=(s[j]+i)%(c+1);//暴力算尺每个周期的亮度
        }
        for (int j=1;j<=100;j++){
            for (int k=1;k<=100;k++){
                sum[i][j][k]=zhouqi[j][k]+sum[i][j-1][k]+sum[i][j][k-1]-sum[i][j-1][k-1];//容斥
            }
        }
    }
    int ans=0;
    for (int i=0;i<q;i++){
        int k=xin[i].t%(c+1);//容斥计算
        ans=sum[k][xin[i].x2][xin[i].y2]-sum[k][xin[i].x1-1][xin[i].y2]-sum[k][xin[i].x2][xin[i].y1-1]+sum[k][xin[i].x1-1][xin[i].y1-1];
        printf("%d\n",ans);
    }
}