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.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

/*
 public class _835C {

 }

 */

public class _835C
{
	public void solve() throws FileNotFoundException
	{
		InputStream inputStream = System.in;

		InputHelper inputHelper = new InputHelper(inputStream);

		PrintStream out = System.out;

		// actual solution
		int n = inputHelper.readInteger();

		int q = inputHelper.readInteger();

		int c = inputHelper.readInteger();

		int[][][] star = new int[101][101][11];

		for (int i = 0; i < n; i++)
		{
			int x = inputHelper.readInteger();
			int y = inputHelper.readInteger();
			int s = inputHelper.readInteger();

			star[x][y][s]++;
		}

		int[][][] dp = new int[101][101][11];

		for (int i = 0; i <= c; i++)
		{
			dp[0][0][i] = star[0][0][i];
		}

		for (int j = 1; j <= 100; j++)
		{
			for (int k = 0; k <= c; k++)
			{
				dp[0][j][k] = dp[0][j - 1][k] + star[0][j][k];
			}
		}

		for (int i = 1; i <= 100; i++)
		{
			for (int k = 0; k <= c; k++)
			{
				dp[i][0][k] = dp[i - 1][0][k] + star[i][0][k];
			}
		}

		for (int i = 1; i <= 100; i++)
		{
			for (int j = 1; j <= 100; j++)
			{
				for (int k = 0; k <= c; k++)
				{
					dp[i][j][k] = dp[i - 1][j][k] + dp[i][j - 1][k]
							- dp[i - 1][j - 1][k] + star[i][j][k];
				}
			}
		}

		for (int qi = 0; qi < q; qi++)
		{
			int t = inputHelper.readInteger();
			int x1 = inputHelper.readInteger();
			int y1 = inputHelper.readInteger();
			int x2 = inputHelper.readInteger();
			int y2 = inputHelper.readInteger();

			int b = 0;
			for (int i = 0; i <= 10; i++)
			{
				int cs = (dp[x2][y2][i] - dp[x1 - 1][y2][i] - dp[x2][y1 - 1][i] + dp[x1 - 1][y1 - 1][i]);

				int cb = (i + t) % (c + 1);

				b += (cb * cs);
			}

			System.out.println(b);
		}
		// end here
	}

	public static void main(String[] args) throws FileNotFoundException
	{
		(new _835C()).solve();
	}

	class InputHelper
	{
		StringTokenizer tokenizer = null;
		private BufferedReader bufferedReader;

		public InputHelper(InputStream inputStream)
		{
			InputStreamReader inputStreamReader = new InputStreamReader(
					inputStream);
			bufferedReader = new BufferedReader(inputStreamReader, 16384);
		}

		public String read()
		{
			while (tokenizer == null || !tokenizer.hasMoreTokens())
			{
				try
				{
					String line = bufferedReader.readLine();
					if (line == null)
					{
						return null;
					}
					tokenizer = new StringTokenizer(line);
				}
				catch (IOException e)
				{
					e.printStackTrace();
				}
			}

			return tokenizer.nextToken();
		}

		public Integer readInteger()
		{
			return Integer.parseInt(read());
		}

		public Long readLong()
		{
			return Long.parseLong(read());
		}
	}
}