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 Star {
        static class Parser {
    final private int BUFFER_SIZE = 1 << 16;
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;

    public Parser(InputStream in) {
        din = new DataInputStream(in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    public long nextLong() throws Exception {
        long ret = 0;
        byte c = read();
        while (c <= ' ') c = read();
        boolean neg = c == '-';
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (c > ' ');
        if (neg) return -ret;
        return ret;
    }

    //reads in the next string
    public String next() throws Exception {
        StringBuilder ret = new StringBuilder();
        byte c = read();
        while (c <= ' ') c = read();
        do {
            ret = ret.append((char) c);
            c = read();
        } while (c > ' ');
        return ret.toString();
    }

    public int nextInt() throws Exception {
        int ret = 0;
        byte c = read();
        while (c <= ' ') c = read();
        boolean neg = c == '-';
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (c > ' ');
        if (neg) return -ret;
        return ret;
    }

    private void fillBuffer() throws Exception {
        bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
        if (bytesRead == -1) buffer[0] = -1;
    }

    private byte read() throws Exception {
        if (bufferPointer == bytesRead) fillBuffer();
        return buffer[bufferPointer++];
    }
}
        static class Cell{
            int x,y;
            long arr[]=new long[11];
            
        }
        
    public static void main(String args[])throws Exception{
        Parser pr=new Parser(System.in);
        PrintWriter out=new PrintWriter(System.out);
        int n,q;
        long c;
        n=pr.nextInt();
        q=pr.nextInt();
        c=pr.nextLong();
        int lim=150;
        Cell cor[][]=new Cell[lim+1][lim+1];
        for(int i=0;i<=lim;i++){
            for(int j=0;j<=lim;j++){
                cor[i][j]=new Cell();
            }
        }
        for(int i=0;i<n;i++){
            int x,y,s;
            x=pr.nextInt();
            y=pr.nextInt();
            s=pr.nextInt();
            cor[x][y].arr[s]++;
        }
        
        for(int j=1;j<=lim;j++){
            for(int cnt=0;cnt<=10;cnt++){
                cor[0][j].arr[cnt]+=cor[0][j-1].arr[cnt];
            }
        }
        for(int i=1;i<=lim;i++){
            for(int cnt=0;cnt<=10;cnt++){
                cor[i][0].arr[cnt]+=cor[i-1][0].arr[cnt];
            }
        }
        for(int i=1;i<=lim;i++){
            for(int j=1;j<=lim;j++){
                for(int cnt=0;cnt<=10;cnt++){
                    long first=cor[i-1][j].arr[cnt];
                    long second=cor[i][j-1].arr[cnt];
                    long third=cor[i-1][j-1].arr[cnt];
                    cor[i][j].arr[cnt]+=(first+second-third);
                }
            }
        }
        //System.out.println(Arrays.toString(cor[1][1].arr));
        while(q-->0){
            long t=pr.nextInt();
            int xl,yl,xu,yu;
            xl=pr.nextInt();
            yl=pr.nextInt();
            xu=pr.nextInt();
            yu=pr.nextInt();
            //System.out.println(xu+" "+yu);
            long complete=calc(cor,xu,yu,t,c+1l);
            long sub1=calc(cor,xu,yl-1,t,c+1l);
            long sub2=calc(cor,xl-1,yu,t,c+1l);
            long add=calc(cor,xl-1,yl-1,t,c+1l);
            long ans=complete+add-sub1-sub2;
            //System.out.println("comp "+complete);
            //System.out.println("sub1 "+sub1);
            //System.out.println("sub2 "+sub2);
            //System.out.println("add "+add);
            out.println(ans);
        }
        out.close();
    }
    
    static long calc(Cell corr[][],int x,int y,long t,long mod){
        
        long ret=(0);
        for(int cnt=0;cnt<=10;cnt++){
            long times=corr[x][y].arr[cnt];
            long abc=((long)cnt+t%mod)%mod;
            
            ret+=times*abc;
            
        }
        return ret;
    }
}
