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 <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define MOD 100000
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int main(){
      int n,m,r,q;
      while(cin>>n>>m&&n&&m){
            vector<P> V[10000];
            int ps[n];
            REP(i,n)ps[i]=-1;
            cin>>r;
            REP(i,r){
                  int a,b,c,d;
                  scanf("%d%d%d%d",&a,&b,&c,&d);b--;c--;
                  if(d==1)ps[b]=a;
                  else V[c].PB(MP(ps[b],a));
            }
            cin>>q;
            REP(i,q){
                  vector<P> VV;
                  int a,b,c;
                  scanf("%d%d%d",&a,&b,&c);c--;
                  REP(j,V[c].size()){
                        P p=V[c][j];
                        if(b<p.first||p.second<a)continue;
                        if(p.first<a){
                              if(p.second<=b)VV.PB(MP(a,p.second));
                              else VV.PB(MP(a,b));
                        }else{
                              if(p.second<=b)VV.PB(MP(p.first,p.second));
                              else VV.PB(MP(p.first,b));
                        }
                  }
                  sort(ALL(VV));
                  int s=0,e=0,ans=0;
                  //REP(i,VV.size())cout<<VV[i].first<<" "<<VV[i].second<<endl;
                  REP(j,VV.size()){
                        if(j==0){
                              s=VV[j].first;
                              e=VV[j].second;
                              continue;
                        }
                        if(e>=VV[j].first){
                              e=max(e,VV[j].second);
                        }else{
                              ans+=(e-s);
                              s=VV[j].first;
                              e=VV[j].second;
                        }
                        //cout<<s<<" "<<e<<endl;
                  }
                  ans+=(e-s);
                  cout<<ans<<endl;
            }
      }
}

C++: #include<bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
typedef pair<int,int> P;

//-----------------------------------------------------------------------

int N,M,R,Q;
int A[10000][1005]; //生徒番号,時間

signed main()
{   
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(cin>>N>>M,N){
        memset(A,0,sizeof(A));
        cin>>R;
        REP(i,R){
            int t,n,m,s;
            cin>>t>>n>>m>>s;
            t-=540; n--; m--;
            if(s) A[m][t]++;
            else A[m][t]--;
        }
        REP(i,M){
            REP(j,1000){
                A[i][j+1]+=A[i][j];
            }
        }
        cin>>Q;
        REP(i,Q){
            int s,e,m;
            cin>>s>>e>>m;
            s-=540; e-=540; m--;
            int res=0;
            for(int i=s;i<e;i++){
                res+=(A[m][i]>=1);
            }
            cout<<res<<endl;
        }
    }
}

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

int main()
{
	int N, M;
	while (cin >> N >> M, N || M){

		//rの入力
		int r, t[1001], n[1001], m[10001], s[1001], q, ts, te, qm;
		fill(t, t + 1001, 0);
		fill(n, n + 1001, 0);
		fill(m, m + 10001, 0);
		fill(s, s + 1001, 0);

		cin >> r;
		for (int i = 0; i < r; i++){
			cin >> t[i] >> n[i] >> m[i] >> s[i];
		}
		cin >> q;

		//qの入力と計算
		for (int c = 0; c < q; c++){
			cin >> ts >> te >> qm;

			//記録
			int tm[1261];
			int pc[1261];
			fill(tm, tm + 1261, 0);
			fill(pc, pc + 1261, 0);
			for (int i = 0; i < r; i++){
				if (m[i] == qm){
					if (s[i] == 1){
						pc[n[i]] = t[i];
					}
					if (s[i] == 0){
						for (int j = pc[n[i]]; j <= t[i]; j++){
							tm[j] = 1;
						}
					}
				}
			}

			//カウント
			bool login = false;
			int counter = 0;
			int temp;
			for (int i = ts; i < te; i++){
				if (tm[i] == 1 && login == false){
					temp = i;
					login = true;
				}
				if (tm[i] == 0 && login == true){
					counter += i - 1 - temp;
					login = false;
				}
			//	cout << "i:" << i << " tm[i]:" << tm[i] << " login:" << login << " temp:" << temp << endl;
			}
			if (login == true){
				counter += te - temp;
			}
			cout << counter << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<string.h>
#include<vector>

using namespace std;

bool student[1000][1260];

int main(){
	while(true){
		memset(student,0,sizeof(student));
		int n,m;
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		int r;
		cin >> r;
		
		vector<int> iodata[1000][2];
		int user[10000];
		int num = 0;
		memset(user,-1,sizeof(user));
		for(int i = 0;i < r;i++){
			int t,a,b,f;
			cin >> t >> a >> b >> f;
			if(user[b] == -1){
				user[b] = num;
				num++;
			}
			iodata[user[b]][f].push_back(t);
		}
		
		for(int i = 0;i < num;i++){
			for(int j = 0;j < iodata[i][1].size();j++){
				for(int k = iodata[i][1][j];k < iodata[i][0][j];k++){
					student[i][k] = 1;
				}
			}
		}
		
		int q;
		cin >> q;
		for(int i= 0;i < q;i++){
			int ts,te,c;
			cin >> ts >> te >> c;
			if(user[c] == -1){
				cout << 0 << endl;
			}else{
				int time = 0;
				for(int j = ts;j < te;j++){
					if(student[user[c]][j] == 1) time++;
				}
				cout << time << endl;
			}
		}
	}
	
	return 0;
}