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 <algorithm>
using namespace std;

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

		//rの入力
		int r, t[1001], n[1001], m[1001], s[1001], q, ts, te, qm;
		fill(t, t + 1001, 0);
		fill(n, n + 1001, 0);
		fill(m, m + 1001, 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>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 10e15+9
#define MOD 1000000007
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int N, M, r, q;

int t, n, m, s, ts, te;

int atime[1010][10010];
bool used[1010][10010];

int main(){
	while (cin >> N >> M&&N + M){
		REP(i, 1010){
			REP(j, 10010){
				atime[i][j] = 0;
				used[i][j] = 0;
			}
		}
		cin >> r;
		REP(i, r){
			cin >> t >> n >> m >> s;
			t -= 540;
			if (s == 1){
				atime[n][m] = t;
			}
			else{
				FOR(j, atime[n][m], t){
					used[j][m] = 1;
				}
			}
		}
		cin >> q;
		REP(i, q){
			int ans = 0, t = -1;
			cin >> ts >> te >> m;
			ts -= 540;
			te -= 540;
			FOR(j, ts, te + 1){
				if (t == -1){
					if (used[j][m])t = j;
				}
				else{
					if (!used[j][m]){
						//cout << "!" << endl;
						//cout << j - 1 << " " << t << endl;
						ans += j - t;
						t = -1;
					}
				}
			}
			if (t != -1){
				ans += te - t;
			}
			cout << ans << endl;
		}
	}
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string.h>
#include<math.h>
#include<cstring>
using namespace std;

int main(){
	while(1){
		int sum,N,M,r,i,j,k,q,ts,te,start,m,rec[1001][4],in=0,pc[1001];
		cin>>N>>M;
		if(N==0&&M==0)break;
		cin>>r;
		for(i=0;i<r;i++){
			cin>>rec[i][0]>>rec[i][1]>>rec[i][2]>>rec[i][3];
		}
		rec[r][0]=1261;
		cin>>q;
		for(i=0;i<q;i++){
			sum=0;
			cin>>ts>>te>>m;
			if(ts<rec[0][0])ts=rec[0][0];
			if(te>rec[r-1][0])te=rec[r-1][0];
			for(j=0;j<=N;j++){
				pc[j]=te;
			}
			for(j=0;rec[j][0]<ts;j++){
				if(rec[j][2]!=m)continue;
				if(rec[j][3]==1){
					in++;
					pc[rec[j][1]]=ts;
				}else if(rec[j][3]==0){
					in--;
					pc[rec[j][1]]=te;
				}
			}
			if(in>0){
				start=ts;
			}else{
				start=te;
			}
			for(;rec[j][0]<te;j++){
				if(rec[j][2]!=m)continue;
				if(rec[j][3]==1&&in!=0){
					in++;
					pc[rec[j][1]]=rec[j][0];
				}else if(rec[j][3]==1&&in==0){
					start=rec[j][0];
					in++;
					pc[rec[j][1]]=rec[j][0];
				}else if(rec[j][3]==0&&in==1){
					in--;
					sum+=rec[j][0]-start;
					pc[rec[j][1]]=te;
					start=te;
				}else{
					in--;
					pc[rec[j][1]]=te;
				}
			}
			sum+=(te-start);
			cout<<sum<<endl;
		}
	}
    return 0;
}

C++: #include <iostream>

using namespace std;

int st[10000][1261] = {0};
int main() {
	int N, M;
	while ( cin >> N >> M, N || M ) {
		fill(&st[0][0], &st[0][0]+10000*1261, 0);
		int r; cin >> r;
		for (int i = 0; i < r; ++i) {
			int t, n, m, s; cin >> t >> n >> m >> s; --n, --m;
			if (s == 0) { // logout
				st[m][t] = -1;
			}
			else {
				st[m][t] = 1;
			}
		}
		for (int i = 0; i < M; ++i) {
			for (int j = 1; j <= 1260; ++j) {
				st[i][j] += st[i][j-1];
			}
		}
		for (int i = 0; i < M; ++i) {
			for (int j = 0; j <= 1260; ++j) {
				st[i][j] = st[i][j] ? 1 : 0;
			}
		}
		for (int i = 0; i < M; ++i) {
			for (int j = 1; j <= 1260; ++j) {
				st[i][j] += st[i][j-1];
			}
		}
		int q; cin >> q;
		for (int t = 0; t < q; ++t) {
			int s, e, m; cin >> s >> e >> m; --m;
			cout << st[m][e-1]-st[m][s-1] << endl;
		}
	}
}