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 <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e16;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1

ll sq(ll num) { return num*num; }
ll mod_pow(ll x, ll n) {
	if (n == 0)return 1;
	if (n == 1)return x%MOD;
	ll res = sq(mod_pow(x, n / 2));
	res %= MOD;
	if (n % 2 == 1) {
		res *= x;
		res %= MOD;
	}
	return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }

ll N,M;

typedef struct st{
	ll t,n,m,s;
	st(ll _t,ll _n,ll _m,ll _s):t(_t),n(_n),m(_m),s(_s){}
}ST;

ll cnt[10001][800];

int main(){
	while(cin >> N >> M && N+M){
		rep(i,10001)rep(j,800)cnt[i][j] = 0;
		ll r;
		cin >> r;
		rep(i,r){
			ll t,n,m,s;
			cin >> t >> n >> m >> s;
			m--;
			if(s)cnt[m][t-540]++;
			else cnt[m][t-540]--;
		}
		rep(i,M)rep(j,800-1)cnt[i][j+1] += cnt[i][j];
		// FOR(j,775-540,880- 540)cout << cnt[0][j] << " ";
		// cout << endl;
		ll q;
		cin >> q;
		rep(i,q){
			ll ts,te,m;
			ll ans = 0;
			cin >> ts >> te >> m;
			ts -= 540;
			te -= 540;
			m--;
			FOR(j,ts,te){
				if(cnt[m][j] != 0)ans++;
			}
			cout << ans << endl;
		}
	}
}

C++: #include <iostream>
#include <vector>
#include <cstring>
using namespace std;

typedef vector<int> V;

typedef struct{
  int t,n,m,s;
} Record;

int main(){
  int n,m,r,q;
  
  while(cin >> n >> m ,n + m){
    const int MAX = 1260-540;

    cin >> r;
    Record d[r];
    int cnt[m+1][MAX+1];
    int use[m][n];

    memset(use,0,sizeof(use));
    memset(cnt,0,sizeof(cnt));

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

    int ts,tt,sn;
    cin >> q;
    for(int i = 0 ; i < q ; i++){
      cin >> ts >> tt >> sn;

      int ans = 0;
      for(int i = ts ; i < tt ; i++){
	if(cnt[sn][i-540]) ans++;
      } 
      cout << ans << endl;
    }
  }

  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <list>

using namespace std;

typedef pair<int, int> P;

int main()
{
	while(1) {
		int N, M, r, q;
		int t[1001], n[1001], m[1001], s[1001];
		cin >> N >> M;
		if(!N && !M) break;
		cin >> r;
		for(int i = 0; i < r; ++i) {
			cin >> t[i] >> n[i] >> m[i] >> s[i];
		}
		cin >> q;
		while(q--) {
			int start, end, target, count = 0, ans = 0;
			int beg;
			cin >> start >> end >> target;
			beg = -1;
			for(int i = 0; i < r; ++i) {
				if(m[i] != target) continue;
				// endを越えたら集計終了
				if(t[i] >= end) {
					if(count > 0) { ans += end - beg; }
					break;
				}
				// start以前のカウンタをセット
				if(s[i] == 1)      { ++count; }
				else if(s[i] == 0) { --count; }
				if(t[i] < start) {
					if(count > 0) beg = start;
					else          beg = -1;
					continue;
				}
				// カウンタが0になったら連続起動終了
				if(count == 0) {
					ans += t[i] - beg;
					beg = -1;
					continue;
				}
				// ガウンタが0から1になったら連続起動開始
				if(count == 1 && beg == -1) { beg = t[i]; continue; }
			}
			cout << ans << endl;
		}
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){

	int n,m;
	int r;
	int q;

	//int student[10000][800];



	int **student = new int*[1005];
	for(int i=0;i<1005;i++){
		student[i] = new int[800];
	}


	int *realToImage;
	realToImage = new int[10005];

	int *imageToReal;
	imageToReal = new int[2000];

	while(cin>>n>>m){
		if(n==0&&m==0)break;

		int studentNum=0;

		for(int i=0;i<2000;i++){
			imageToReal[i]=-1;
		}

		for(int i=0;i<10005;i++){
			realToImage[i]=-1;
		}

		for(int i=0;i<1005;i++){
			for(int j=0;j<800;j++){
				student[i][j]=0;
				
			}
		}
		//cout<<"unko"<<endl;
		cin>>r;

		for(int i=0;i<r;i++){
			int tmpT,tmpN,tmpM,tmpS;
			cin>>tmpT>>tmpN>>tmpM>>tmpS;

			if(realToImage[tmpM]==-1){
				realToImage[tmpM]=studentNum;
				imageToReal[studentNum]=tmpM;
				studentNum++;
			}

			int image=realToImage[tmpM];
			if(tmpS==1){
				student[image][tmpT-540]++;
			}
			else{
				student[image][tmpT-540]--;
			}
		}

		for(int i=0;i<1000;i++){
			int num=0;
			for(int j=0;j<800;j++){
				if(student[i][j]==1){
					num++;
				}
				else if(student[i][j]==-1){
					num--;
				}
				student[i][j]=num;
			}
		}

		cin>>q;

		for(int i=0;i<q;i++){
			int start,end,studentM;
			cin>>start>>end>>studentM;
			start-=540;
			end-=540;

			int cnt=0;

			if(realToImage[studentM]==-1){
				cout<<0<<endl;
				continue;
			}

			int ansImage=realToImage[studentM];

			for(int j=start;j<end;j++){
				if(student[ansImage][j]>0){
					cnt++;
				}
			}

			cout<<cnt<<endl;
		}


	}

	return 0;


}