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++: #define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
#include <complex>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 1e9
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define MOD 998244353
#define REP(i,n) for(long long i = 0;i < n;++i)    
#define seg_size 524288
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}
int imos[1270];
int main() {
	while (true) {
		int n, m;
		cin >> n >> m;
		if (n == 0) return 0;
		int r;
		cin >> r;
		vector<tuple<int, int, int>> gogo;
		REP(i, r) {
			int a, b, c, d;
			cin >> a >> b >> c >> d;
			c--;
			if (d == 1) {
				gogo.push_back(make_tuple(1, c, a));
			}
			else {
				gogo.push_back(make_tuple(-1, c, a));
			}
		}
		int query;
		cin >> query;
		REP(i, query) {
			int a, b, c;
			cin >> a >> b >> c;
			c--;
			REP(q, 1270) {
				imos[q] = 0;
			}
			REP(q, gogo.size()) {
				if (get<1>(gogo[q]) == c) {
					imos[get<2>(gogo[q])] += get<0>(gogo[q]);
				}
			}
			for (int q = 1; q < 1270; ++q) {
				imos[q] += imos[q - 1];
			}
			int ans = 0;
			for (int q = a; q < b; ++q) {
				if (imos[q] > 0) {
					ans++;
				}
			}
			cout << ans << endl;
		}
	}
}

C++: #include <iostream>
#include <vector>
#include <cstring>
#define rep(i,a,b) for(int i=(a); i<(b); i++)

using namespace std;
int N , M;

typedef struct data {
  data(int t , int m) : t(t) , m(m){}
  int t , m;
} data;

int main(){
  while(cin >> N >> M , N + M){
    vector<data> logs[1001];
    int r; cin >> r;
    rep(i,0,r){
      int t,n,m,s;
      cin >> t >> n >> m >> s;
      logs[m].push_back(data(t,m));
    }
    int q; cin >> q;
    rep(i,0,q){
      int ans = 0;
      int ts, te, m;
      cin >> ts >> te >> m;
      
      int login_time[10001];
      memset(login_time,-1,sizeof(login_time));
      rep(j,0,logs[m].size()){
        if(login_time[m] == -1){
          login_time[m] = logs[m][j].t;
        } else {
          int login = login_time[m];
          int logout = logs[m][j].t;
          if(login <= ts && ts <= logout && logout <= te)
            ans += logout - ts;
          else if(ts <= login && logout <= te)
            ans += logout - login;
          else if(ts <= login && login <= te && te <= logout)
            ans += te - login;
          else if(login <= ts && te <= logout)
            ans += te - ts;
          else if(logout <= ts || te <= login)
            ans;
          login_time[m] = -1;
        }
      }
      cout << ans << endl;
    }
  }
  return 0;
}

C++: #include<iostream>

using namespace std;

#define MMAX 10000
#define tMAX 1260
int main(){

	int N, M;
	int r;
	int t, n, m1, s;
	int q;
	int ts, te, m2;
	int num,cnt;
	int data[MMAX+1][tMAX+1];

	while (1){
		cin >> N >> M;
		if (N == 0 && M == 0) break;
		for (int i = 1; i <= M; i++){
			for (int j = 0; j <= tMAX; j++){
				/*data[i][j] = 0;*/
			}
		}
		cin >> r;
		for (int i = 0; i < r; i++){
			cin >> t >> n >> m1 >> s;
			if (s == 0) data[m1][t]--;
			else data[m1][t]++;
		}
		cin >> q;
		for (int i = 1; i <= M; i++){
			num = 0;
			for (int j = 0; j <= tMAX; j++){
				num += data[i][j];
				data[i][j] = num;
			}
		}
		for (int i = 0; i < q; i++){
			cin >> ts >> te >> m2;
			cnt = 0;
			for (int j = ts; j < te; j++){
				if (data[m2][j] >= 1) cnt++;
			}
			cout << cnt << endl;
		}
	}
	return 0;
}

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

typedef pair<int, int> P;

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

    bool record[10010][720];
    memset(record, 0, sizeof(record));
    map<P, int> info;
    
    int t, n, m, s;
    while(r--){
      cin >> t >> n >> m >> s;
      t -= 540;
      
      if(s == 1){
	info[P(m, n)] = t;
      }
      else if(s == 0){
	for(int i = info[P(m, n)] ; i < t ; i++){
	  record[m][i] = true;
	}
	info.erase(P(m, n));
      }
    }
    
    int q, ts, te;
    cin >> q;
    while(q--){
      cin >> ts >> te >> m;
      ts -= 540, te -= 540;
      int ans = 0;
      for(int i = ts ; i < te ; i++){
	if(record[m][i]) ans++;
      }
      cout << ans << endl;
    }
  }
  return 0;
}