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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>


using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }
#endif

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define clear(arr, val) memset(arr, val, sizeof(arr))

#define rep(i, n) for (int i = 0; i < n; ++i)

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

typedef long long ll;
typedef pair<int, int> pint;

const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };


int main()
{
	int n, m, r, q;
	while (scanf("%d%d", &n, &m), n)
	{
		scanf("%d", &r);
		static int stu[10010][750];
		for (int i = 0; i < m; ++i)
			for (int j = 0; j < 750; ++j)
				stu[i][j] = 0;
		while (r--)
		{
			int t, n, m, s;
			scanf("%d%d%d%d", &t, &n, &m, &s);
			if (s == 0)
				s = -1;
			stu[m][t - 540] += s;
		}

		scanf("%d", &q);
		while (q--)
		{
			int s, e, m, res = 0;
			scanf("%d%d%d", &s, &e, &m);
			s -= 540, e -= 540;
			for (int t = 0, in = 0; t < e; ++t)
			{
				in += stu[m][t];
				if (t >= s && in > 0)
					++res;
			}
			printf("%d\n", res);
		}
	}
}

C++: #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstring>
#include <string>
#include <sstream>
#include <bitset>
using namespace std;
#define INF	100000000
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define fi first
#define sec second
#define lb lower_bound
#define ub upper_bound
#define SS stringstream
#define rep(i,n) for(int i = 0; i < n; i++)
#define SORT(x) sort((x).begin(), (x).end())
#define clr(a,b) memset((a),(b),sizeof(a))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<P> Vp;
typedef priority_queue<P, vector<P>, greater<P> > PQ;

int deta[1000][1000];

int main(){
	int n,m;
	while(scanf("%d%d", &n, &m),n||m){
		rep(i,1000) rep(j,1000) deta[i][j] = 0;
		int r;
		scanf("%d", &r);
		rep(i,r){
			int a,b,c,d;
			scanf("%d%d%d%d", &a, &b, &c, &d);
			a -= 540;
			c--;
			if(d == 1){
				deta[c][a]++;
			} else{
				deta[c][a]--;
			}
		}
		rep(i,1000){
			for(int j = 1; j < 1000; j++){
				deta[i][j] += deta[i][j-1];
			}
		}
		int q;
		scanf("%d", &q);
		rep(i,q){
			int a,b,c;
			int cnt = 0;
			scanf("%d%d%d", &a, &b, &c);
			a -= 540; b -= 540; c--;
			for(int j = a; j < b; j++){
				if(deta[c][j]) cnt++;
			}
			printf("%d\n", cnt);
		}
	}
}

C++: 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;



int main(){

	int N,M,r;
	while(cin >> N >> M && !(N == 0 && M == 0)){
		// Ô
		vector<pair<int,int> > Gakusei[10001];
		cin >> r;
		pair<int,int> pc[1001];
		for(int i = 0; i < r; i++){
			int t;
			int n;
			int m;
			int s;
			cin >> t >> n >> m >> s;
			if(s == 1){
				pc[n].first = t;
			}
			else{
				pc[n].second = t;
				Gakusei[m].push_back(pc[n]);
			}
		}

		int q;
		cin >> q;
		//bool term[1261];
		for(int i = 0; i < q; i++){
			//fill(term,term+1261,false);
			int cnt = 0;
			int ts,te,m;
			cin >> ts >> te >> m;

			sort(Gakusei[m].begin(),Gakusei[m].end());
			int cTime = ts;
			for(int j = 0; j < Gakusei[m].size(); j++){
				// æÃ~ÉJnÔª¢©ç©Ä¢­
				
				if(cTime > Gakusei[m][j].second)
					continue;
				else{
					cnt += (min(te,Gakusei[m][j].second) - max(cTime,Gakusei[m][j].first));
					cTime = Gakusei[m][j].second;
				}
			}
			cout << cnt << endl;
		}

	}
	return 0;
}

C++: #include <stdio.h>
#include <string.h>

int main(void){
	int N, M, r, t, n, m, s, log[1000][721], q, ts, tg, i, j, k, flag[1000], count;;
	while(1){
		scanf("%d%d",&N,&M);
		if(N == 0 && M == 0)
			break;
		memset(log,0,sizeof(log));
		scanf("%d",&r);
		for(i = 0;i < r;i++){
			scanf("%d%d%d%d",&t,&n,&m,&s);
			if(s == 1)
				log[n - 1][t - 540] = m;
			else if(s == 0)
				log[n - 1][t - 540] = -1;
		}
		memset(flag,0,sizeof(flag));
		for(i = 0;i < N;i++){
			for(j = 0;j <= 720;j++){
				if(log[i][j] && flag[i] == 0)
					flag[i] = log[i][j];
				else if(log[i][j] && flag[i] != 0)
					flag[i] = 0;
				if(flag[i] != 0)
					log[i][j] = flag[i];
			}
		}
		scanf("%d",&q);
		for(i = 0;i < q;i++){
			scanf("%d%d%d",&ts,&tg,&m);
			memset(flag,0,sizeof(flag));
			count = 0;
			for(j = ts - 540;j <= tg - 540;j++){
				for(k = 0;k < N;k++){
					if(flag[k]){
						count++;
						break;
					}
				}
				for(k = 0;k < N;k++){
					if(log[k][j] == m)
						flag[k] = 1;
					else if(log[k][j] != 0)
						flag[k] = 0;
				}
			}
			printf("%d\n",count);
		}
	}
	return 0;
}