You have a computer literacy course in your university. In the computer system, the login/logout records of all PCs in a day are stored in a file. Although students may use two or more PCs at a time, no one can log in to a PC which has been logged in by someone who has not logged out of that PC yet.

You are asked to write a program that calculates the total time of a student that he/she used at least one PC in a given time period (probably in a laboratory class) based on the records in the file.

The following are example login/logout records.

* The student 1 logged in to the PC 1 at 12:55
* The student 2 logged in to the PC 4 at 13:00
* The student 1 logged in to the PC 2 at 13:10
* The student 1 logged out of the PC 2 at 13:20
* The student 1 logged in to the PC 3 at 13:30
* The student 1 logged out of the PC 1 at 13:40
* The student 1 logged out of the PC 3 at 13:45
* The student 1 logged in to the PC 1 at 14:20
* The student 2 logged out of the PC 4 at 14:30
* The student 1 logged out of the PC 1 at 14:40


For a query such as "Give usage of the student 1 between 13:00 and 14:30", your program should answer "55 minutes", that is, the sum of 45 minutes from 13:00 to 13:45 and 10 minutes from 14:20 to 14:30, as depicted in the following figure.

<image>



Input

The input is a sequence of a number of datasets. The end of the input is indicated by a line containing two zeros separated by a space. The number of datasets never exceeds 10.

Each dataset is formatted as follows.

> N M
>  r
>  record1
>  ...
>  recordr
>  q
>  query1
>  ...
>  queryq
>

The numbers N  and M  in the first line are the numbers of PCs and the students, respectively. r  is the number of records. q  is the number of queries. These four are integers satisfying the following.

> 1 ≤ N  ≤ 1000, 1 ≤ M  ≤ 10000, 2 ≤ r  ≤ 1000, 1 ≤ q  ≤ 50

Each record consists of four integers, delimited by a space, as follows.

> t  n  m  s

s  is 0 or 1. If s  is 1, this line means that the student m  logged in to the PC n  at time t . If s  is 0, it means that the student m  logged out of the PC n  at time t . The time is expressed as elapsed minutes from 0:00 of the day. t , n  and m  satisfy the following.

> 540 ≤ t  ≤ 1260, 1 ≤ n  ≤ N , 1 ≤ m  ≤ M

You may assume the following about the records.
* Records are stored in ascending order of time t.
* No two records for the same PC has the same time t.
* No PCs are being logged in before the time of the first record nor after that of the last record in the file.
* Login and logout records for one PC appear alternatingly, and each of the login-logout record pairs is for the same student.

Each query consists of three integers delimited by a space, as follows.

> ts  te  m

It represents "Usage of the student m  between ts  and te ". ts , te  and m  satisfy the following.

> 540 ≤ ts  < te  ≤ 1260, 1 ≤ m  ≤ M

Output

For each query, print a line having a decimal integer indicating the time of usage in minutes. Output lines should not have any character other than this number.

Example

Input

4 2
10
775 1 1 1
780 4 2 1
790 2 1 1
800 2 1 0
810 3 1 1
820 1 1 0
825 3 1 0
860 1 1 1
870 4 2 0
880 1 1 0
1
780 870 1
13 15
12
540 12 13 1
600 12 13 0
650 13 15 1
660 12 15 1
665 11 13 1
670 13 15 0
675 11 13 0
680 12 15 0
1000 11 14 1
1060 12 14 1
1060 11 14 0
1080 12 14 0
3
540 700 13
600 1000 15
1000 1200 11
1 1
2
600 1 1 1
700 1 1 0
5
540 600 1
550 650 1
610 620 1
650 750 1
700 800 1
0 0


Output

55
70
30
0
0
50
10
50
0
import java.util.*;
import java.util.regex.*;
import static java.lang.Math.*;
import static java.lang.System.out;

// AOJ
public class Main {
	final Scanner sc=new Scanner(System.in);
	final int[] vx={0,1,0,-1}, vy={-1,0,1,0};
	static class Point{
		int x, y;
		Point(int x, int y){	this.x=x;	this.y=y;}
		Point(){	this.x=0; this.y=0;}
		@Override public String toString(){	return "("+this.x+","+this.y+")";}
		static boolean ok(int x,int y,int X,int Y,int min){
			return (min<=x&&x<X && min<=y&&y<Y)?true:false;
		}
		static boolean ok(int x,int y,int X,int Y){	return ok(x,y,X,Y,0);}
	}
	public static void main(String[] args) {
		new Main().AOJ1148();
	}
	
	void AOJ1148(){
		while(sc.hasNext()){
			int N=sc.nextInt(),M=sc.nextInt();
			if((N|M)==0)	break;
			int r=sc.nextInt();
			C1148[] rec=new C1148[r];
			for(int i=0; i<r; i++)	rec[i]=new C1148(sc.nextInt(),sc.nextInt(),sc.nextInt(),sc.nextInt()==1);
			int q=sc.nextInt();
			while(--q>=0){
				int ts=sc.nextInt(),te=sc.nextInt(),st=sc.nextInt();
				int ans=0,temp=0,lastIn=0;
				for(int i=0; i<r; i++){
					if(rec[i].st==st){
						if(rec[i].in){	// login
							lastIn=(temp==0?rec[i].time:lastIn);
							temp++;
						}else{	// logout
							if(--temp==0){
								int out=(te<rec[i].time?te:rec[i].time);
								lastIn=(lastIn<ts?ts:lastIn);
								ans+=max(0,out-lastIn);
							}
						}
					}
				}
				out.println(ans);
			}
		}
	}
	class C1148{
		int time,pc,st;	boolean in;
		C1148(int time,int pc,int st,boolean in){
			this.time=time;	this.pc=pc;	this.st=st;	this.in=in;
		}
	}
	
	void AOJ1147(){
		while(sc.hasNext()){
			int n=sc.nextInt();
			if(n==0)	break;
			int[] score=new int[n];
			for(int i=0; i<n; i++)	score[i]=sc.nextInt();
			Arrays.sort(score);
			int sum=0;
			for(int i=1; i<n-1; i++)	sum+=score[i];
			out.println(sum/(n-2));
		}
	}
	
	int[] rx={1,1,2,1,2,3,1,2,1}, fy={-2,-1,-1,0,0,0,1,1,2};
	int[] lx={-1,-1,-2,-1,-2,-3,-1,-2,-1};
	void AOJ1150(){
		while(sc.hasNext()){
			int W=sc.nextInt(), H=sc.nextInt();
			if((W|H)==0)	break;
			char[][] c=new char[W][H];
			int[][][] close=new int[W][H][2];
			PriorityQueue<C1150> open=new PriorityQueue<C1150>();
			for(int y=0; y<H; y++){
				for(int x=0; x<W; x++){
					char temp=sc.next().charAt(0);
					c[x][y]=temp;
					if(temp=='S'){
						open.add(new C1150(x,y,0,0));
						open.add(new C1150(x,y,0,1));
						close[x][y][0]=-1;
						close[x][y][1]=-1;
					}
				}
			}
			int ans=-1;
			while(!open.isEmpty()){
				C1150 now=open.poll();
				//out.println(now.x+" "+now.y);
				int[] fx=(now.f==0? rx: lx);
				for(int i=0; i<9; i++){
					int xx=now.x+fx[i], yy=now.y+fy[i];
					if(!Point.ok(xx, yy, W, H))	continue;
					if(c[xx][yy]=='X')	continue;
					if(c[xx][yy]=='T'){
						ans=(ans<0? now.c: min(ans,now.c));
						continue;
					}
					if(now.c+Character.digit(c[xx][yy],10)>=close[xx][yy][1-now.f] && close[xx][yy][1-now.f]!=0)	continue;
					open.add(new C1150(xx,yy,now.c+Character.digit(c[xx][yy],10),now.f==0?1:0));
					close[xx][yy][1-now.f]=now.c+Character.digit(c[xx][yy],10);
				}
			}
			out.println(ans);
		}
	}
	class C1150 implements Comparable<C1150>{
		int x,y,c,f;
		C1150(int x,int y,int c,int f){
			this.x=x;	this.y=y;	this.c=c;	this.f=f;
		}
		@Override public int compareTo(C1150 arg0) {
			if(this.c<c)	return -1;
			if(this.c>c)	return 1;
			return 0;
		}
	}
	
	/*
	*** Compile Error
	void AOJ1148(){
		while(sc.hasNext()){
			int N=sc.nextInt(), M=sc.nextInt();
			if((N|M)==0)break;
			int r=sc.nextInt();
			ArrayList<C1148>[] list=new ArrayList[M];
			for(int i=0; i<M; i++)	list[i]=new ArrayList<C1148>();
			for(int i=0; i<r; i++){
				int time=sc.nextInt(), pc=sc.nextInt(), st=sc.nextInt()-1, k=sc.nextInt();
				ArrayList<C1148> ar=list[st];
				if(k==1){
					if(ar.size()==0)	ar.add(new C1148(time,1));
					else{
						for(int j=0; j<ar.size(); j++){
							C1148 temp=ar.get(j);
							if(temp.s<=time && time<=temp.e){
								temp.count++;
								ar.set(j, temp);
								break;
							}else{
								//out.println("R"+j);
								ar.add(new C1148(time,1));
								break;
							}
						}
						list[st]=ar;
					}
				}else{
					for(int j=0; j<ar.size(); j++){
						C1148 temp=ar.get(j);
						temp.count--;
						if(temp.count==0){
							temp.e=time;
							temp.count=-1;
							ar.set(j,temp);
							break;
						}else if(temp.count>0){
							ar.set(j,temp);
							break;
						}
					}
				}
				//debug
				//out.println("K"+k+" ")
			}
			
			//debug
			//for(int i=0; i<M; i++)	out.println(list[i]);
			
			int Q=sc.nextInt();
			for(int i=0; i<Q; i++){
				int S=sc.nextInt(), E=sc.nextInt(), ST=sc.nextInt()-1;
				ArrayList<C1148> ar=list[ST];
				int ans=0;
				for(int j=0; j<ar.size(); j++){
					C1148 temp2=ar.get(j);
					C1148 temp=new C1148(temp2.s,temp2.e,temp2.count);
					if(temp.s<=S && S<=temp.e)	temp.s=S;
					if(temp.s<=E && E<=temp.e)	temp.e=E;
					if(S<=temp.s && temp.e<=E)	ans+=temp.e-temp.s;
					//out.println("ANS"+ans+""+temp.s+" E"+temp.e);
				}
				out.println(ans);
			}
		}
	}
	class C1148{
		int s,e,count;
		C1148(int s,int count){
			this.s=s;	this.e=Integer.MAX_VALUE;	this.count=count;
		}
		C1148(int s,int e,int count){
			this.s=s;	this.e=e;	this.count=count;
		}
		@Override public String toString(){
			return "S"+s+" E"+e+" C"+count;
		}
	}
	*/
	
}