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<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long

using namespace std;
int main(){
  int n,m;
  while(cin>>n>>m,n+m){
    int r,q;
    cin>>r;
    int stu[m+10][550]={};
    for(int i=0;i<r;i++){
      int a,b,c,d;
      cin>>a>>b>>c>>d;
      if(d){
	stu[c][a-540]++;
      }else{
	stu[c][a-540]--;
      }
    }
    int anss[m+10][550]={};
    for(int i=1;i<=m;i++){
      int po=0;
      for(int j=0;j<=521;j++){

	if(j==0&&po>0)anss[i][j]=1;
	else if(j==0&&po<=0)anss[i][j]=0;
	else if(po>0)anss[i][j]=anss[i][j-1]+1;
	else if(po<=0)anss[i][j]=anss[i][j-1];
	//if(i==1)cout<<j<<" "<<anss[1][j]<<endl;
	po+=stu[i][j];
      }
    }
    cin>>q;
    for(int i=0;i<q;i++){
      int fr,to,num;cin>>fr>>to>>num;
      cout<<anss[num][to-540]-anss[num][fr-540]<<endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;

int main(){
	int N, n, M, m, r, q, s, t;
	while(cin >> N >> M){
		if(N == 0 && M == 0) break;
		vector<vector<int>> lgin(M+1,vector<int>(1262,0)); 
		cin >> r;
		for(int i = 0;i<r;i++){
			cin >> t >> n >> m >> s;
			if(s == 1){
				lgin[m][t+1] += 1;
			}
			else{
				lgin[m][t+1] -= 1;
			}
		}
		cin >> q;
		for(int i = 0;i<q;i++){
			cin >> n >> r >> m;
			if(lgin[m][0]==0) {
				for(int j = 540;j<1261;j++){
					lgin[m][j] = lgin[m][j-1]+lgin[m][j];
				}
				for(int j = 540;j<1261;j++){
					if(lgin[m][j]>0){
						lgin[m][j] = lgin[m][j-1] + 1;
					}
					else{
						lgin[m][j] = lgin[m][j-1];
					}
				}
				lgin[m][0] = 1;
			}
			cout << lgin[m][r] - lgin[m][n] << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

void solve(int n,int m){
    vector<vector<int>> a(m,vector<int>(1300));
    int r;
    cin>>r;
    rep(i,r){
        int t,x,y,s;
        cin>>t>>x>>y>>s;
        --y;
        if(s)++a[y][t];
        else --a[y][t];
    }
    rep(i,m)rep(j,1299){
        a[i][j+1]+=a[i][j];
    }
    rep(i,m)rep(j,1300){
        a[i][j]=min(1,a[i][j]);
    }
    rep(i,m)rep(j,1299){
        a[i][j+1]+=a[i][j];
    }
    int q;
    cin>>q;
    while(q--){
        int s,t,y;
        cin>>s>>t>>y;
        --y;
        cout<<a[y][t-1]-a[y][s-1]<<endl;
    }
}


int main(){
    int n,m;
    while(cin>>n>>m,n!=0)solve(n,m);
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <functional>
#include <sstream>
#include <complex>
#include <climits>
using namespace std;

#define REP(i,a,n) for(int i=(a);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define EPS 1e-8

typedef struct _kiroku{
	int t,n,m,s;
} kiroku;

kiroku kiro[1024];

int main(){
	int n,m,r,q,ts,te,mm;
	while(scanf("%d%d",&n,&m),n|m){
		scanf("%d",&r);
		rep(i,r)scanf("%d%d%d%d",&kiro[i].t, &kiro[i].n, &kiro[i].m, &kiro[i].s);
		
		scanf("%d",&q);
		int cnt = 0;
		rep(i,q){
			scanf("%d%d%d",&ts,&te,&mm);
			int sum = 0;
			int start = 0;
			for(int i=0; i<r; i++)if( kiro[i].m==mm ){
				if( cnt==0 ){	 //init
					start = kiro[i].t;
					cnt++;
				}else{
					if( kiro[i].s==1 )cnt++;
					else              cnt--;
					if( cnt==0 ){
						if( start>=te ) break;
						//printf("%d - %d = %d\n",kiro[i].t,max(ts,start),kiro[i].t-start);
						sum += (min(te,kiro[i].t)-max(ts,start));
					}
				}
			}
			printf("%d\n",sum);
		}
	}
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int a[10000 + 1][730] = {0};

int main() {
    int N, M;
    while (cin >> N >> M && N + M) {
        for (int i = 0; i < 10001; i++) {
            for (int j = 0; j < 730; j++)
                a[i][j] = 0;
        }

        int r, q;
        cin >> r;
        for (int i = 0; i < r; i++) {
            int t, n, m, s;
            cin >> t >> n >> m >> s;
            a[m][t - 540] += (s == 1) ? 1 : -1;
        }
        
        for (int i = 1; i <= M; i++) {
            for (int j = 1; j <= 720; j++) {
                a[i][j] += a[i][j - 1];
            }
        }
        
        cin >> q;
        for (int i = 0; i < q; i++) {
            int ts, te, m;
            cin >> ts >> te >> m;
            ts -= 540; te -= 540;
            int sum = 0;
            for (int j = ts; j < te; j++) {
                if (a[m][j] > 0) ++sum;
            }
            cout << sum << endl;
        }
    }
}