Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		_, M := io.NextInt(), io.NextInt()
		if M == 0 {
			break
		}
		r := io.NextInt()
		t, m, s := make([]int, r), make([]int, r), make([]int, r)
		for i := 0; i < r; i++ {
			t[i], _, m[i], s[i] = io.NextInt(), io.NextInt(), io.NextInt()-1, io.NextInt()
		}
		q := io.NextInt()
		for i := 0; i < q; i++ {
			ss, ee, mm := io.NextInt(), io.NextInt(), io.NextInt()-1
			x := make([]int, 1300)
			for j := 0; j < r; j++ {
				if m[j] == mm {
					if s[j] == 1 {
						x[t[j]]++
					} else {
						x[t[j]]--
					}
				}
			}
			for j := 1; j < 1300; j++ {
				x[j] = x[j] + x[j-1]
			}
			ans := 0
			for j := ss; j < ee; j++ {
				if x[j] > 0 {
					ans++
				}
			}
			io.Println(ans)
		}
	}
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>
 
// #include <unordered_set>
// #include <unordered_map>
 
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
 
#define pb push_back
#define mp make_pair
 
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
 
typedef std::pair<int, int> P;
typedef long long ll;
typedef long double ld;
 
const int MOD = 1000000007;
const int INF = 1e9;
const ll LINF = INF * 1ll * INF;
const ld DINF = 1e200;
const double EPS = 1e-10;
const double PI  = acos(-1.0);
 
using namespace std;
 
#define int long long

const int MAX_V=1000;
// int memo[1000001]={0};
int dist[MAX_V][MAX_V];



signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cin?????????

    int a,b;
    int r,q;
    int t,n,m,s;
    int ts,tr,M;
    int ans;

    while(cin>>a>>b){
        // cin>>a>>b;
        if(a==0&&b==0)break;



        int table[10001][1261-540]={0};

        cin>>r;

        REP(i,r){

            // cout<<"t,n,m,s??\???"<<endl;

            cin>>t>>n>>m>>s;
            t-=540;

            

            if(s==1){
                table[m][t]++;
            }else if(s==0){
                table[m][t]--;
            }

        }

        REP(i,10001){
            REP(j,1261){
                if(table[i][j]>=0)table[i][j+1]+=table[i][j];
            }
        }

        cin>>q;

        REP(i,q){
            ans=0;
            // cout<<"ts,tr,M??\???"<<endl;

            cin>>ts>>tr>>M;
            ts-=540;
            tr-=540;

            for(int l=ts;l<tr;l++){

                // cout<<table[M][l]<<" ";
                
                if(table[M][l]>=1)ans++;
            }
            // cout<<endl;
            // cout<<"??????"<<M<<"????????¨?????????"<<ans<<endl;

            cout<<ans<<endl;

        }
        // REP(i,30){
        //     cout<<i<<" ";
        // }cout<<endl;

        // REP(i,5){
        //     REP(j,30){
        //         cout<<table[i][j]<<" ";
        //     }cout<<endl;
        // }

    }






}

C++: #include<iostream>
#define S 10001
#define T 1261
using namespace std;

int main(){
  int N,M,r,q;
  int ti[S],n[S],m[S],s[S],time[T],f[S];
  int bti,ati,st,anst;
  while(1){
    cin>>N>>M;
    if(N+M==0) break;
    cin>>r;
    for(int i=0;i<r;i++) cin>>ti[i]>>n[i]>>m[i]>>s[i];
    cin>>q;
    for(int i=0;i<q;i++){
      anst=0;
      cin>>bti>>ati>>st;
      for(int q=0;q<T;q++) time[q]=0;
       
      for(int j=0;j<r;j++){
	if(s[j]==1 && m[j]==st)f[j]=1;
	for(int k=j+1;k<r;k++)
	  if(s[k]==0 && m[k]==st && n[k]==n[j] && f[j]==1){
	    f[j]=0;
	    for(int l=ti[j]+1;l<=ti[k];l++)
	      if(time[l]==0 && l>bti && l<=ati){
		time[l]=1;
		anst++;
	      }
	  }
      }
      cout<<anst<<endl;
    }
  }
  return 0;
}

C++: #include <bits/stdc++.h>
#define r(i,a,n) for(int i=a;i<n;i++)
using namespace std;
int main(){
	int n,p;
	while(cin>>n>>p,n){
		int q,a[p][1261-540],ch[p][1261-540],b,c,d,e;
		r(i,0,p)r(j,0,1261-540)ch[i][j]=a[i][j]=0;
		cin>>q;
		r(i,0,q){
			cin>>b>>c>>d>>e;
			b-=540;
			if(e==1){a[d-1][b]++;ch[d-1][b]=c;}
			else{
				for(int j=b-1;j>=0;j--){
					if(ch[d-1][j]==c)break;
					a[d-1][j]++;
				}
			}
		}
		cin>>q;
		while(q--){
			int s=0;
			cin>>b>>c>>d;
			b-=540;
			c-=540;
			r(i,b,c)if(a[d-1][i])s++;
			cout<<s<<endl;
		}
	}
}

C++: #include<bits/stdc++.h>
#define INF 2147483647
#define lli long long int
#define MOD 1000000007
#define pb push_back

using namespace std;
typedef vector<int> vi;
typedef vector< vector<int> > vvi;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;

void print(vector<vector<int>> v) {
	for (int i = 0; i < v.size(); i++) {
		for (int j = 540; j <= 1260; j++) {
			cout << v[i][j];;
		}
		cout  << endl;
	}
}

int main() {

	while(1) {
		int N,M; cin >> N >> M;
		if (N + M == 0) break;
		int r; cin >> r;

		vector<vector<int>> use(M+1,vector<int>(1260,0));

		for (int i = 0; i < r; i++) {
			int t,n,m,s; cin >> t >> n >> m >> s;
			if (s == 1) {
				use[m][t] += 1;
			}else if (s == 0) {
				use[m][t] -= 1;
			}
		}

		for (int i = 1; i <= M; i++) {
			for (int j = 541; j <= 1260; j++) {
				use[i][j] += use[i][j-1];
			}
		}
		//print(use);

		int q; cin >> q;
		for (int i = 0; i < q; i++) {
			int ts,te,m; cin >> ts >> te >> m;
			int ans = 0;
			for (int j = ts; j < te; j++) {
				if (use[m][j] > 0) {
					ans++;
				}
			}
			cout << ans << endl;
		}
	}

	return 0;
}