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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.PriorityQueue;
import java.util.Random;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class CF427_2 {
	static int N;
	static int MOD = (int) (1e9 + 7);

	public static void main(String args[]) {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int t = 1;
		while (t-- > 0) {
			int n = in.nextInt();
			int q = in.nextInt();
			int c = in.nextInt();
			int x[] = new int[n];
			int y[] = new int[n];
			int b[] = new int[n];
			int pre[][][] = new int[101][101][26];
			int mx = 0;
			for (int i = 0; i < n; i++) {
				x[i] = in.nextInt();
				y[i] = in.nextInt();
				b[i] = in.nextInt();
				mx = Math.max(mx, c - b[i]);
			}

			for (int i = 0; i <= 25; i++) {
				for (int j = 0; j < n; j++) {
					pre[x[j]][y[j]][i] += b[j];
					b[j] += 1;
					if (b[j] > c) {
						b[j] = 0;
					}
				}
				for (int j = 1; j <= 100; j++) {
					for (int k = 1; k <= 100; k++) {
						if (j - 1 >= 0)
							pre[j][k][i] += pre[j - 1][k][i];
						if (k - 1 >= 0) {
							pre[j][k][i] += pre[j][k - 1][i];
						}
						if (k - 1 >= 0 && j - 1 >= 0) {
							pre[j][k][i] -= pre[j - 1][k - 1][i];
						}

					}
				}

			}
			for (int i = 0; i < q; i++) {
				int ca = in.nextInt();
				int x1 = in.nextInt();
				int y1 = in.nextInt();
				int x2 = in.nextInt();
				int y2 = in.nextInt();
				if (ca > mx)
					ca = (ca - mx - 1) % (c + 1) + mx + 1;
				int ans = pre[x2][y2][ca];
				if (x1 - 1 >= 0) {
					ans -= pre[x1 - 1][y2][ca];
				}
				if (y1 - 1 >= 0) {
					ans -= pre[x2][y1 - 1][ca];
				}
				if (x1 - 1 >= 0 && y1 - 1 >= 0) {
					ans += pre[x1 - 1][y1 - 1][ca];
				}
				out.println(ans);
			}

		}
		out.close();

	}

	static void rand(char a[]) {
		int n = a.length;
		for (int i = 0; i < n; i++) {
			Random r = new Random();
			int j = r.nextInt(n);
			char temp = a[j];
			a[j] = a[i];
			a[i] = temp;
		}

	}

	static class FastScanner {
		private StringTokenizer tokenizer;
		private BufferedReader reader;

		public FastScanner(InputStream inputStream) {
			reader = new BufferedReader(new InputStreamReader(inputStream));
		}

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

		public int nextInt() {
			return Integer.parseInt(next());
		}

	}

}