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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

int nextInt() {int a; cin >> a; return a;}
char nextChar() {char a; cin >> a; return a;}
double nextDouble() {double a; cin >> a; return a;}
string nextString() {string a; cin >> a; return a;}

void inputVector(vector<int> &v, int &n) {rep(i,n){v.push_back(nextInt());}}
void inputVector(vector<double> &v, int &n) {rep(i,n){v.push_back(nextDouble());}}
void inputVector(vector<string> &v, int &n) {rep(i,n){v.push_back(nextString());}}

int memo[1270][10010];

signed main() {
    int N, M;
    while (cin >> N >> M) {
	if (!N) break;

	memset(memo, 0, sizeof(memo));

	int r;
	cin >> r;
	rep(i, r) {
	    int t, n, m, s;
	    cin >> t >> n >> m >> s;
	    m--;

	    if (s == 0) memo[t][m]--;
	    else memo[t][m]++;
	}
	REP(i, 500, 1265) {
	    rep(j, M) {
		memo[i][j] += memo[i - 1][j];
	    }
	}
	REP(i, 500, 1265) {
	    rep(j, M) {
		memo[i][j] = memo[i][j] > 0;
	    }
	}
	REP(i, 500, 1265) {
	    rep(j, M) {
		memo[i][j] += memo[i - 1][j];
	    }
	}

	int q;
	cin >> q;
	rep(i, q) {
	    int ts, te, m;
	    cin >> ts >> te >> m;
	    m--;

	    cout << memo[te - 1][m] - memo[ts - 1][m] << endl;
	}
    }

    return 0;
}

C++: #include <iostream>
using namespace std;
 
int main() {
    int n,m,r,q,t,nn,mm,s,ts,te;
    int si[10001]={};
    int ei[10001]={};
    int pcn[10001]={};
    int lts[1000]={};
    int lte[1000]={};
    int ni[1000]={};
    while(1){
        cin >> n >> m;
        if(n==0){return 0;}
        for(int i=1;i<=m;i++){
            si[i]=-1;
            pcn[i]=0;
        }
        cin >> r;
        int pi=0;
        for(int i=0;i<r;i++){
            cin >> t >> nn >> mm >> s;
            if(s){
                pcn[mm]++;
                if(pcn[mm]==1){
                    if(si[mm]==-1){
                        si[mm]=pi;
                    }else{
                        ni[ei[mm]]=pi;
                    }
                        ei[mm]=pi;
                        lts[pi]=t;
                        ni[pi]=-1;
                        pi++;
                }
            }else{
                pcn[mm]--;
                if(pcn[mm]==0){
                    lte[ei[mm]]=t;
                }
            }
        }
        cin >> q;
        for(int i=0;i<q;i++){
            cin >> ts >> te >> mm;
            int tt=0;
            for(int j=si[mm];j!=-1;j=ni[j]){
                if(lts[j]<ts && lte[j]>=ts && lte[j]<te){
                    tt=lte[j]-ts;
                }
                if(lts[j]<ts && lte[j]>=te){
                    tt=te-ts;
                    break;
                }
                if(lts[j]>=ts && lte[j]<te){
                    tt+=lte[j]-lts[j];
                }
                if(lts[j]>=ts && lts[j]<te && lte[j]>=te){
                    tt+=te-lts[j];
                    break;
                }
                if(lts[j]>=te){
                    break;
                }
            }
            cout << tt << endl;
        }
    }
}

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
  
using namespace std;

#define pi 3.141592653589793

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

typedef struct Record rec;

int solve(rec re[], int r){
	int t_s, t_e, m_q;
	int req[721] = {};
	// 540~1260を記録、t - 540すればok.
	cin >> t_s >> t_e >> m_q;
	for(int j = 0; j < r; j++){
		if(re[j].m == m_q){
			if(re[j].s == 1) req[re[j].t - 540]++;
			else if(re[j].s == 0) req[re[j].t - 540]--;
		}
	}
	int ans = 0;
	for(int j = 0; j < t_e - 540; j++){
		if(j != 0) req[j] += req[j - 1];
		// cout << j + 540 << ":" << req[j] << endl;
		if(req[j] > 0 && j >= t_s - 540) ans++;
	}
	return ans;
}

int main()
{
	int N, M;
	while(1){
		cin >> N >> M;
		if(N == 0 && M == 0) break;
		int r, q;
		cin >> r;
		rec re[1001];
		for(int i = 0; i < r; i++){
			cin >> re[i].t >> re[i].n >> re[i].m >> re[i].s;
		}
		cin >> q;
		for(int i = 0; i < q; i++){
			cout << solve(re, r) << endl;
		}
	}
	return 0;
}