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 <string>
#include <cstring>
#include <algorithm>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;
typedef long long ll;

int cnt[10005][1500];

int main()
{
    int N,M;
    while(cin >> N >> M) {
        if(N == 0 && M == 0) break;
        
        int ptime[1005];
        memset(ptime,0,sizeof(ptime));

        int r;
        cin >> r;
        
        vector<pair<pair<int,int>,int> > v;
        rep(i,r) {
            int t,n,m,s;
            cin >> t >> n >> m >> s;

            if(s == 1) {
                ptime[n] = t;
            }
            else {
                pair<int,int> p = make_pair(ptime[n],t);
                v.push_back(make_pair(p,m));
            }
        }

        memset(cnt,0,sizeof(cnt));
        rep(i,v.size()) {
            int start = v[i].first.first;
            int end = v[i].first.second;
            int num = v[i].second;

            cnt[num][start]++;
            cnt[num][end+1]--;
        }

        rep(i,M+1) {
            REP(j,540,1500) {
                cnt[i][j+1] += cnt[i][j];
            }
        }

        vector<pair<pair<int,int>,int> > res;
        rep(i,M+1) {
            REP(j,540,1500) {
                if(cnt[i][j] > 0) {
                    int s = j;
                    while(cnt[i][j+1] > 0) {
                        j++;
                    }
                    
                    pair<int,int> p = make_pair(s,j);
                    res.push_back(make_pair(p,i));
                }
            }
        }


        int q;
        cin >> q;

        rep(i,q) {
            int s,t,m;
            cin >> s >> t >> m;
            
            int ans = 0;
            rep(j,res.size()) {
                int start = res[j].first.first;
                int end = res[j].first.second;
                int num = res[j].second;
                
                if(num != m) continue;

                if(end < s || t < start) continue;
                else if(t == start || s == end) ans++;
                else if(start <= s && t <= end) {
                    ans += t - s;
                }
                else if(s < start && t <= end) {
                    ans += t - start;
                }
                else if(start <= s && end < t) {
                    ans += end - s;
                }
                else if(s < start && end < t) {
                    ans += end - start;
                }
            }
            cout << ans << endl;
        }
    }

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int N, M, r, q;
vector<P> v[10001];
int arr[2000];

int main()
{
	while (scanf("%d %d", &N, &M), N){
		for (int i = 0; i < 10001; i++){
			v[i].clear();
		}
		scanf("%d", &r);
		for (int i = 0; i < r; i++){
			int t, n, m, s;
			scanf("%d %d %d %d", &t, &n, &m, &s);
			int val = s ? 1 : -1;
			v[m].push_back(P(t, val));
		}
		scanf("%d", &q);
		for (int i = 0; i < q; i++){
			int s, e, m;
			scanf("%d %d %d", &s, &e, &m);
			
			sort(v[m].begin(), v[m].end());
			memset(arr, 0, sizeof(arr));
			for (int j = 0; j < v[m].size(); j++){
				arr[v[m][j].first] += v[m][j].second;
			}
			for (int j = 0; j < 1999; j++){
				arr[j + 1] += arr[j];
			}
			int res = 0;
			for (int j = s; j < e; j++){
				res += !!arr[j];
			}
			printf("%d\n", res);
		}
	}
}

C++: #include<iostream>
#include<vector>
#include<list>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
using namespace std;
bool a[10000][721];
int main() {
	int N, M, r, q;
	while (cin >> N >> M&&N != 0 && M != 0) {
		cin >> r;
		for (int i = 0; i < M; i++) {
			for (int j = 0; j <= 720; j++) {
				a[i][j] = false;
			}
		}
		int b[1000][2];
		for (int z = 0; z < r; z++) {
			int t,n, m, s;
			cin >> t >> n >> m >> s;
			m--;
			t -= 540;
			if (s == 1) {
				b[n][0] = t;
				b[n][1] = m;
			}
			else {
				for (int i = b[n][0]; i < t; i++) {
					a[m][i] = true;
				}
			}
		}
		cin >> q;
		for (int z = 0; z < q; z++) {
			int ts, te, m;
			cin >> ts >> te >> m;
			int sum = 0;
			ts -= 540;
			te -= 540;
			m--;
			for (int i = ts; i < te; i++) {
				if (a[m][i]) sum++;
			}
			cout << sum << endl;
		}
	}
}

C++: #include<iostream>
#include<bitset>
#include<vector>

using namespace std;

#define N 1001
#define MIN 1440
#define INV (-1)

typedef pair< int, pair<int,int> > lgtime;
typedef vector< lgtime > PC;

int main(){
	while(true){
		int n,m,r,q;
		vector< PC > PCs;
		
		PCs.resize(N);
		cin>>n>>m;
		if(n==0&&m==0)break;
		cin>>r;
		for(int i=0;i<r;++i){
			int t,n,m,s;

			cin>>t>>n>>m>>s;
			if(s==1){
				lgtime a;
				a.first=m;
				a.second.first=t;
				a.second.second=INV;
				PCs[n].push_back(a);
			}else if(s==0){
				PCs[n][PCs[n].size()-1].second.second=t;
			}
		}
		cin>>q;
		for(int i=0;i<q;++i){
			int ts,te,m;
			cin>>ts>>te>>m;
			bitset<MIN> b;
			bitset<MIN> filt;
			for(int j=ts;j<te;++j)
				filt.set(j);
			for(int k=0;k<PCs.size();++k){
				for(int l=0;l<PCs[k].size();++l){
					if( PCs[k][l].first==m ){
						for(int o=PCs[k][l].second.first; o<PCs[k][l].second.second;++o){
							b.set(o);
						}
					}
				}
			}
			b=b&filt;
			cout<<b.count()<<endl;
		}
	}
	return 0;
}