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 <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>

typedef long long ll;
using namespace std;



struct Slog{
	int pc;
	int time;
	int inout;
	
	Slog(){}
	Slog(int n, int t, int s) : pc(n), time(t), inout(s) {}
};

struct Slog2{
	int in;
	int out;
	
	bool operator< (const Slog2 &s) const{
		return (*this).in < s.in;
	}
};

struct Sstu{
	int num;
	vector<Slog> log;
	vector<Slog2> log2;
	
	Sstu(){}
	void MakeLog2(int N){
		vector<Slog2> list(N);
		for(int i=0;i<log.size();i++){
			if(log[i].inout == 1){
				list[log[i].pc-1].in = log[i].time;
				list[log[i].pc-1].out = log[i].time;
			}
			if(log[i].inout == 0){
				list[log[i].pc-1].out = log[i].time;
				log2.push_back(list[log[i].pc-1]);
			}
		}
		sort(log2.begin(), log2.end());
	}
	void print(){
		if(!log2.size()) return;
		cout<< " student_"<< num<< endl;
		for(int i=0;i<log2.size();i++){
			cout<< " "<< log2[i].in<< " "<< log2[i].out<< endl;
		}
	}

};

bool solve(){
	int N, M, r, q;
	cin>> N>> M;
	if(N==0 && M==0) return false;
	
	vector<Sstu> stu(M);
	for(int i=0;i<M;i++) stu[i].num = i+1;
	cin>> r;
	for(int i=0;i<r;i++){
		int t, n, m, s;
		cin>> t>> n>> m>> s;
		Slog in(n,t,s);
		stu[m-1].log.push_back(in);
	}
	for(int i=0;i<M;i++) stu[i].MakeLog2(N);
//	for(int i=0;i<M;i++) stu[i].print();
	
	cin>> q;
	for(int i=0;i<q;i++){
		int ans = 0;
		int ts, te, num;
		cin>> ts>> te>> num;
//		cout<< "  "<< ts<<" "<< te<<" "<< num<< endl;
		Sstu *s = &stu[num-1];
		bool on[1300];
		memset(on, false, sizeof(on));
		for(int j=0; j < s->log2.size(); j++){
			for(int t=s->log2[j].in; t<s->log2[j].out; t++) on[t] = true;
		}
		for(int t=ts;t<te;t++) if(on[t]) ans++;
		cout<< ans<< endl;
	}
	
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	while(solve());

	return 0;
}

C++: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
const int MAX_T = 1260 - 540 + 10;

int main() {
  int N, M;
  while(cin >>N >>M && N){
    vector< vector<int> > v(M, vector<int>(MAX_T, 0));
    int R, Q; cin >>R;
    REP(i, R){
      int t, n, m, s; cin >>t >>n >>m >>s;
      t -= 540;
      --m;
      if(s) v[m][t] += 1;
      else v[m][t] -= 1;
    }
    REP(i, M) FOR(j, 1, MAX_T) v[i][j] += v[i][j - 1];
    cin >>Q;
    REP(i, Q){
      int ans = 0, ts, te, m; cin >>ts >>te >>m;
      --m;
      ts -= 540;
      te -= 540;
      FOR(t, ts, te) ans += (v[m][t] >= 1 ? 1 : 0);
      cout <<ans <<endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define rrep(i,n,l) for(int i=n-1;i>=l;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a);
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int d[10010][1261];
//int e[10010][1261];

int main(){
	int N,M,r;
	while(1){
		cin>>N>>M;
		if(N+M==0) break;
		cin>>r;
		memset(d,0,sizeof(d));
		//memset(e,0,sizeof(e));
		int t,n,m,s;
		rep(i,0,r){
			cin>>t>>n>>m>>s;
			if(s==1){
				d[m][t]++;
			}else{
				d[m][t]--;
			}
		}
		rep(j,1,M+1){
			rep(i,541,1261){
				d[j][i]+=d[j][i-1];
			}
		}
		rep(j,1,M+1){
			rep(i,540,1261){
				if(i==540){
					if(d[j][i]>0) d[j][i]=1;
					else d[j][i]=0;
				}else{
					if(d[j][i]>0) d[j][i]=d[j][i-1]+1;
					else d[j][i]=d[j][i-1];
				}
				//if(j==1 && 777<=i && i<=900) cout<<j<<" "<<i<<" "<<e[j][i]<<endl;
			}
			//cout<<endl;
		}
		int q;
		cin>>q;
		int ts,te,mm;
		rep(i,0,q){
			cin>>ts>>te>>mm;
			o(d[mm][te-1]-d[mm][ts-1]);
		}
	}
}

C++: #include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;++i)
using namespace std;
int main(){
int u,r,q,a,b,c;
while(cin>>r,r){cin>>r>>r;
vector<int>t(r),m(r),s(r);
r(i,r)cin>>t[i]>>m[i]>>m[i]>>s[i];cin>>q;
r(i,q){cin>>a>>b>>c;
int an=0,cn=0,p=a;
r(i,t.size()){u=min(t[i],b);
if(cn)an+=max(u-p,0);
if(m[i]==c){if(s[i])cn++;else cn--;}
p=max(p,u);}
cout<<an<<endl;}}}