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.
/**
 * Created by prakashn on 7/31/2017.
 */

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

public class _835C {
    InputStream is;
    PrintWriter out;
    String INPUT = "3 4 5\n" +
            "1 1 2\n" +
            "2 3 0\n" +
            "3 3 1\n" +
            "0 1 1 100 100\n" +
            "1 2 2 4 4\n" +
            "2 2 1 4 7\n" +
            "1 50 50 51 51";
    final int MAX_CORD = 100;
    int[][][] cnt;
    int n, q, c;
    // Version 2

    int get(int t, int x1, int y1, int x2, int y2) {
        int res = 0;
        for (int i = 0; i <= c; i++) {
            int brightness = (i + t) % (c + 1);
            int amount = cnt[i][x2][y2] - cnt[i][x1 - 1][y2] - cnt[i][x2][y1 - 1] + cnt[i][x1 - 1][y1 - 1];
            res += amount * brightness;
        }
        return res;
    }

    void solve() {
        n = ni();
        q = ni();
        c = ni();
        cnt = new int[c+1][MAX_CORD+1][MAX_CORD+1];
        for(int i = 0; i < n; i++) {
            int x = ni();
            int y = ni();
            int s = ni();
            cnt[s][x][y]++;
        }
//        tr(cnt[0]);
        for (int p = 0; p <= c; p++) {
            for (int i = 1; i <= MAX_CORD; i++) {
                for (int j = 1; j <= MAX_CORD; j++) {
                    cnt[p][i][j] += cnt[p][i - 1][j] + cnt[p][i][j - 1] - cnt[p][i - 1][j - 1];
                }
            }
        }
        int t, x1, y1, x2, y2;
        for(int i = 0; i < q; i++) {
            t = ni();
            x1 = ni();
            y1 = ni();
            x2 = ni();
            y2 = ni();
            out.write(get(t, x1, y1, x2, y2) + "\n");

        }
    }

    /* version 1
    void solve() {
        int n = ni(), q = ni(), c = ni();
        LinkedList<Star> stars = new LinkedList<>();
        for(int i = 0; i < n; i++) {
            stars.add(new Star(ni(), ni(), ni(), c));
        }

        int t, x1, y1, x2, y2;
        long res = 0;
        for(int i = 0; i < q; i++) {
            t = ni();
            x1 = ni();
            y1 = ni();
            x2 = ni();
            y2 = ni();
            res = 0;


            for(Star s: stars) {
                if(s.x >= x1 && s.y >= y1 && s.x <= x2 && s.y <= y2) {
                    res += s.currentBrightness(t);
                }
            }
            out.println(res);
        }
    }

    class Star {
        public Integer x,y,b, c;
        Star(int x1, int y1, int brig, int max) {
            x = x1;
            y = y1;
            b = brig;
            c = max;
        }
        public int currentBrightness(int t) {
            return (b+t)%(c+1);
        }
        public String toString() {
            return x+":"+y+"  ";
        }
    }
    */
    void run() throws Exception {
        is = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);

        long s = System.currentTimeMillis();
        solve();
        out.flush();
        tr(System.currentTimeMillis() - s + "ms");
    }

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

    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;

    private int readByte() {
        if (lenbuf == -1) throw new InputMismatchException();
        if (ptrbuf >= lenbuf) {
            ptrbuf = 0;
            try {
                lenbuf = is.read(inbuf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (lenbuf <= 0) return -1;
        }
        return inbuf[ptrbuf++];
    }

    private boolean isSpaceChar(int c) {
        return !(c >= 33 && c <= 126);
    }

    private int skip() {
        int b;
        while ((b = readByte()) != -1 && isSpaceChar(b)) ;
        return b;
    }

    private double nd() {
        return Double.parseDouble(ns());
    }

    private char nc() {
        return (char) skip();
    }

    private String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while (p < n && !(isSpaceChar(b))) {
            buf[p++] = (char) b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }

    private char[][] nm(int n, int m) {
        char[][] map = new char[n][];
        for (int i = 0; i < n; i++) map[i] = ns(m);
        return map;
    }

    private int[] na(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = ni();
        return a;
    }

    private int ni() {
        int num = 0, b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }

        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
        if (b == '-') {
            minus = true;
            b = readByte();
        }

        while (true) {
            if (b >= '0' && b <= '9') {
                num = num * 10 + (b - '0');
            } else {
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private boolean oj = System.getProperty("ONLINE_JUDGE") != null;

    private void tr(Object... o) {
        if (!oj) System.out.println(Arrays.deepToString(o));
    }
}
