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<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
typedef pair<ll,ll> LLP;
#define INF 1000000007
#define MOD 1000000007

#define MAX_N 1005
#define MAX_M 10005

int tm[MAX_M][MAX_N];//tm[人数][時間]

int main(){

    int n,m;
    while(cin >> n >> m,n){//PC数、学生数

        REP(i,MAX_M){
            REP(j,MAX_N){
                tm[i][j] = 0;
            }
        }
        int r,t,pc,num,s,q;
        cin >> r;
        REP(i,r){
            cin >> t >> pc >> num >> s;
            num--;//配列の添え字に合わせる
            t-=540;//配列0スタートに合わせる
            if(s == 1){
                //ログイン
                tm[num][t+1]++;
            }else{
                //ログアウト
                tm[num][t+1]--;
            }
        }

        //累積和
        REP(i,m){
            REP(j,MAX_N-1){
                tm[i][j+1] += tm[i][j];//imos累積和
            }
            REP(j,MAX_N){
                if(tm[i][j] > 1){
                    tm[i][j] = 1;
                }
            }
            REP(j,MAX_N-1){
                tm[i][j+1] += tm[i][j];//累積和
            }
        }

        cin >> q;//クエリ

        int ts,tr;
        REP(i,q){
            cin >> ts >> tr >> num;//時刻tsから時刻trまでのnumの利用時間
            num--;
            ts-=540;
            tr-=540;
            cout << tm[num][tr] - tm[num][ts] << endl;
        }
    }


    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <cstdio>
#include <stdio.h>
//#include <cstdio>
//#include <stdio.h>
using namespace std;
const int t_max = 1270;

int main(){
    int N, M;
    while( cin >> N >> M && N && M ){
        vector< vector<int> > data( N+1, vector<int>(t_max));
        int r;
        cin >> r;
        while( r-- ){
            int t, n, m, s;
            cin >> t >> n >> m >> s;
            if( s == 1 ){
                data[n][t] = -m;
            }else{
                for( int i = 0; i < t_max; i++ ){
                    if( data[n][i] == -m ){
                        for( ; i < t; i++ ){
                            data[n][i] = m;
                        }
                        break;
                    }
                }
            }
        }
        int q;
        cin >> q;
        while( q-- ){
            int ts, te, m, sum = 0;
            vector<int> student(t_max);
            //memset( student, 0, sizeof(student));
            cin >> ts >> te >> m;
            for( int i = 0; i <= N; i++ ){
                //int a = 0;
                for( int j = ts; j < te; j++ ){
                    if( data[i][j] == m && student[j] != 1 ){
                        /*
                        if( data[i][j-1] != m || j == ts ){
                            a++;
                        }
                        if( data[i][j+1] != m || j == te ){
                            a++;
                        }
                        */
                        sum++;
                        student[j] = 1;
                    }
                }
                //sum -= a / 2;
            }
            cout << sum << endl;
        }
    }
}

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

int main () {
	int N, M;
	while (cin >> N >> M, N || M) {
		bool table[M + 1][1261];
		int lastin[N + 1];
		int r;
		memset(table, 0, sizeof(table));
		cin >> r;
		for (int i = 0; i < r; i++) {
			int t, n, m, s;
			cin >> t >> n >> m >> s;
			if (s) {
				lastin[n] = t;
			}
			else {
				fill(table[m] + lastin[n], table[m] + t, true);
			}
		}
		int q;
		cin >> q;
		for (int i = 0; i < q; i++) {
			int s, e, m;
			cin >> s >> e >> m;
			cout << count(table[m] + s, table[m] + e, true) << endl;
		}
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

#define MMAX 100

int main(){

	int N, M;
	int r;
	int t, n, m1, s;
	int q;
	int ts, te, m2;
	int num,cnt;
	int data[MMAX+1][1261];

	while (1){
		cin >> N >> M;
		if (N == 0 && M == 0) break;
		for (int i = 1; i <= M; i++){
			for (int j = 0; j < 1261; j++){
				data[i][j] = 0;
			}
		}
		cin >> r;
		for (int i = 0; i < r; i++){
			cin >> t >> n >> m1 >> s;
			if (s == 0) data[m1][t]--;
			else data[m1][t]++;
		}
		cin >> q;
		for (int i = 1; i <= M; i++){
			num = 0;
			for (int j = 0; j < 1261; j++){
				num += data[i][j];
				data[i][j] = num;
			}
		}
		for (int i = 0; i < q; i++){
			cin >> ts >> te >> m2;
			cnt = 0;
			for (int j = ts; j < te; j++){
				if (data[m2][j] >= 1) cnt++;
			}
			cout << cnt << endl;
		}
	}
	return 0;
}