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 <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[10000][1000];

int main(){
	int n,m;
	while(scanf("%d%d", &n, &m),n||m){
		rep(i,10000) 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,10000){
			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<map>
#include<set>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<complex>
#include<numeric>
#include<bitset>
#define INF 1001001001
#define EPS 0.000001

using namespace std;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef pair<int,int> pint;

int memo[10001][800];
int memo2[10001][800];
int main(){
	int n,m,r,q;
	while(1){
		scanf("%d %d",&n,&m);
		if(n==0 && m==0) break;
		scanf("%d",&r);
		int i,j;
		for(i=0;i<=m;i++) for(j=0;j<=721;j++) memo[i][j]=0;
		int t,tn,tm,ts;
		for(i=0;i<r;i++){
			scanf("%d %d %d %d",&t,&tn,&tm,&ts);
			t-=539;
			if(ts==1) memo[tm][t]+=1;
			else memo[tm][t]+=-1;
		}
		for(i=0;i<=m;i++) for(j=1;j<=721;j++) memo[i][j]+=memo[i][j-1];
		for(i=0;i<=m;i++){
			memo2[i][0]=0;
			for(j=1;j<=721;j++){
				if(memo[i][j]>0) memo2[i][j]=memo2[i][j-1]+1;
				else memo2[i][j]=memo2[i][j-1];
			}
		}
		scanf("%d",&q);
		for(i=0;i<q;i++){
			int te;
			scanf("%d %d %d",&ts,&te,&tm);
			ts-=539;
			te-=539;
			printf("%d\n",memo2[tm][te-1]-memo2[tm][ts-1]);
		}
	}
		
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

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

int main()
{
//	cut here before submit 
//	freopen ("testcase.ALLR", "r", stdin );
	int N, M;
	while (scanf ("%d %d", &N, &M ), N, M ){
		vector<int> login[M][N], logout[M][N];
		rep (i, M ){
			rep (j, N ){
				login[i][j].clear();
				logout[i][j].clear();
			} // end rep
		} // end rep

		int r;
		scanf ("%d", &r );
		rep (i, r ){
			int t, n, m, s;
			scanf ("%d %d %d %d", &t, &n, &m, &s );
			n--;m--;
			if (s == 1 ){
				login[m][n].push_back (t );
			}else{
				logout[m][n].push_back (t );
			} // end if
		} // end rep
		int q;
		scanf ("%d", &q );
		vector<int> ans (q, 0 );
		rep (i, q ){
			int ts, te, m;
			scanf ("%d %d %d", &ts, &te, &m );
			m--;
			bool time[1265] = {false};
			rep (j, N ){
				if (!login[m][j].empty() ){
					rep (k, login[m][j].size() ){
						for (int l = login[m][j][k]; l <= logout[m][j][k]; l++ ){
							time[l] = true;
						} // end for
					} // end rep
				} // end if
			} // end rep
			int res = 0;
			bool start = false;
			int s = 0;
			for (int t = ts; t <= te; t++ ){
				if (time[t] && !start ){
					start = true;
					s = t;
				}else
				if (!time[t] && start ){
					start = false;
					res += (t - s - 1);
 				} // end if
			} // end for
			if (start ){
				res += (te - s);
			} // end if
			ans[i] = res;
		} // end rep
		rep (i, q ){
			printf ("%d\n", ans[i] );
		} // end rep
			
	} // end loop
		
	return 0;
}