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.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;
 
public class Main{
 
static PrintWriter out;
static InputReader ir;
 
static void solve(){
 for(;;){
  int N=ir.nextInt();
  int M=ir.nextInt();
  if(N==0&&M==0) return;
  int r=ir.nextInt();
  int[][] rcd=new int[r][];
  for(int i=0;i<r;i++) rcd[i]=ir.nextIntArray(4);
  Arrays.sort(rcd,new Comparator<int[]>(){
   public int compare(int[] p,int[] q){
    if(p[2]!=q[2]) return Integer.compare(p[2],q[2]);
    if(p[1]!=q[1]) return Integer.compare(p[1],q[1]);
    return Integer.compare(p[0],q[0]);
   }
  });
  AL[] segs=new AL[M];
  for(int i=0;i<M;i++) segs[i]=new AL();
  for(int i=0;i<r;i++){
   if(rcd[i][3]==1&&(i+1==r||rcd[i+1][3]==1)){
    segs[rcd[i][2]-1].add(new int[]{rcd[i][0],Integer.MAX_VALUE});
   }
   else{
    segs[rcd[i][2]-1].add(new int[]{rcd[i][0],rcd[i+1][0]});
    i++;
   }
  }
  for(int i=0;i<M;i++) UniteSegmentsAndGetTotalLength(segs[i],1);
  int q=ir.nextInt();
  for(int i=0;i<q;i++){
   int ts=ir.nextInt();
   int te=ir.nextInt();
   int m=ir.nextInt()-1;
   int len=0;
   for(int j=0;j<segs[m].size();j++){
    int[] s=segs[m].get(j);
    if(ts<=s[0]&&te>=s[1]) len+=s[1]-s[0];
    else if(ts>=s[1]||te<=s[0]){}
    else if(ts>=s[0]&&te<=s[1])len+=te-ts;
    else if(ts>=s[0]&&te>=s[1]) len+=s[1]-ts;
    else if(ts<=s[0]&&te<=s[1]) len+=te-s[0];
   }
   out.println(len);
  }
 }
}
 
static class AL extends ArrayList<int[]>{}
 
static long UniteSegmentsAndGetTotalLength(AL seg,int k){
 int n=seg.size();
 Point[] ps=new Point[2*n];
 for(int i=0;i<n;i++){
  int[] s=seg.get(i);
  ps[2*i]=new Point(s[0],true);
  ps[2*i+1]=new Point(s[1],false);
 }
 seg.clear();
 Arrays.sort(ps,new Comparator<Point>(){
  public int compare(Point a,Point b){
   if(a.pos!=b.pos) return Integer.compare(a.pos,b.pos);
   if(a.isLeftSide==b.isLeftSide) return 0;
   if(a.isLeftSide) return -1;
   return 1;
  }
 });
 int cur=0,l=-1;
 long ret=0;
 boolean f=false;
 for(int i=0;i<2*n;i++){
  cur+=ps[i].isLeftSide?1:-1;
  if(cur>=k&&!f){
   f=true;
   l=ps[i].pos;
  }
  else if(cur<k&&f){
   f=false;
   if(l!=ps[i].pos) seg.add(new int[]{l,ps[i].pos});
   ret+=ps[i].pos-l;
  }
 }
 return ret;
}
 
static class Point{
 
 public int pos;
 public boolean isLeftSide;
 
 public Point(int pos,boolean isLeftSide){
  this.pos=pos;
  this.isLeftSide=isLeftSide;
 }
}
 
public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}
 
static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;
 
 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
  
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }
 
 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
  
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
  
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
  
 public boolean hasNext(){skip(); return hasNextByte();}
  
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
  
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
  
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public double nextDouble(){return Double.parseDouble(next());}
 
 public int[] nextIntArray(int n){
  int[] a=new int[n];
  for(int i=0;i<n;i++) a[i]=nextInt();
  return a;
 }
 
 public long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  return a;
 }
 
 public char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}