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.
import java.util.*;
import java.io.*;

// public class Solution
class Solution
{
	static BufferedReader br;
	static String nextIntBuffer[];
	static int nextIntBase;
	static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	static String next() throws IOException {
		if(nextIntBase>=nextIntBuffer.length) {
			nextIntBase =0;
			nextIntBuffer = br.readLine().split(" ");
		}
		return nextIntBuffer[nextIntBase++];
	}

		public static <T1 extends Comparable<T1> ,T2 extends Comparable<T2> > Pair<T1,T2> mp(T1 a,T2 b) {
		return new Pair<T1,T2>(a,b);
	}


	public static void main(String[] args) throws IOException {
		br=new BufferedReader(new InputStreamReader(System.in));
		nextIntBuffer = new String[0];

		int n=nextInt();
		int q=nextInt();
		int c=nextInt();
		// int[][] a=new int[n][3];
		int[][] star_b=new int[101][101];
		int[][][] star_c=new int[101][101][11];

		int[][] sum_b=new int[101][101];
		int[][][] count_c=new int[101][101][11];
		for(int i=0;i<n;i++) 
		{
			// a[i][0]=nextInt();
			// a[i][1]=nextInt();
			// a[i][2]=nextInt();
			int x=nextInt();
			int y=nextInt();
			int b=nextInt();
			// star_b[x][y]+=b;
			star_c[x][y][b]+=1; 
		}

		for(int i=1;i<=100;i++)
		{
			for(int j=1;j<=100;j++)
			{
				// sum_b[i][j]=sum_b[i-1][j]+sum_b[i][j-1]-sum_b[i-1][j-1]+star_b[i][j];
				for(int k=0;k<11;k++)
				count_c[i][j][k]=count_c[i-1][j][k]+count_c[i][j-1][k]-count_c[i-1][j-1][k]+star_c[i][j][k];
			}
		}

		// System.out.println(Arrays.deepToString(sum_b));


		while(q-->0)
		{
			int t=nextInt();
			int x1c=nextInt();
			int y1c=nextInt();
			int x2c=nextInt();
			int y2c=nextInt();

			// sum=sum_b[x2c][y2c]-sum_b[x1c-1][y2c]-sum_b[x2c][y1c-1]+sum_b[x1c-1][y1c-1];
			// System.out.println(sum+" "+count);
			int bright=0;
			for(int i=0;i<11;i++){
				int count=count_c[x2c][y2c][i]-count_c[x1c-1][y2c][i]-count_c[x2c][y1c-1][i]+count_c[x1c-1][y1c-1][i];
				bright+=((i+t)%(c+1))*count;
			}
			System.out.println(bright);
		}

	}

	static boolean inrect(int x1,int x2,int y1,int y2,int x,int y)
	{	
		if((x<=x2 && x>=x1) && (y>=y1 && y<=y2))
			return true;
		return false;

	}
}

class Pair<T1 extends Comparable<T1>, T2 extends Comparable<T2> > implements Comparable<Pair<T1,T2> > {
	  T1 a;
	  T2 b;
	  public Pair(T1 x, T2 y) {
	    a = x; b = y;
	  }
	  @Override
	  public int compareTo(Pair<T1,T2> other) {
	  	int comp1 = a.compareTo(other.a);
	  	if(comp1!=0)
	  		return comp1;
	    return b.compareTo(other.b);
	}
}	