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++: #define _CRT_SECURE_NO_WARNINGS // #pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <functional>
#include <sstream>
#include <cmath>
#include <set>
#include <map>
#include <stack>
using namespace std; 

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(a) a.begin(),a.end()
#define len(x) ((int)(x).size())
#define tmax(a,b,c) max((a),max((b),(c)))
#define tmin(a,b,c) min((a),min((b),(c)))
#define debug(x) cerr << #x << " is " << x << endl;

typedef pair<int, int> Pii;
typedef map<int, int> Mii;
typedef vector<int> Vi;
typedef vector<vector<int> > VVi;
typedef long long ll;
const int inf = 2e9;
const ll ll_inf = 1e17;
const int mod = 1e9 + 7;
const long double eps = 1e-10;
typedef pair<ll, ll> Pll; 

int g[10001][1300];

int main()
{
	int N, M;
	while (cin>>N>>M && (N || M)) {
		memset(g,0,sizeof(g));
		int r; cin >> r;
		rep(i,0,r) {
			int t,n,m,s;
			cin>>t>>n>>m>>s;
			if (s == 1)
				g[m][t] += 1;
			else
				g[m][t] -= 1;
		}
		rep(i,1,M+1) rep(j,540, 1260) g[i][j+1] += g[i][j];  

		int q; cin >> q;
		rep(i,0,q) {
			int s,e,m;
			cin>>s>>e>>m;
			int cnt = 0;
			rep(j,s,e) if (g[m][j]) cnt++;
			cout << cnt << endl;
		}
	}
	return 0;
}

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

using namespace std;

void solve()
{
	int N, M;
	while(cin >> N >> M, N || M)
	{
		vector<bitset<721> > used(M + 1);
		vector< vector<int> > login(M + 1, vector<int>(N + 1));
		int r;
		cin >> r;
		for(int i = 0; i < r; ++i)
		{
			int t, n, m, s;
			cin >> t >> n >> m >> s;
			if(s == 0)
			{
				for(int j = login[m][n]; j < t - 540; ++j)
				{
					used[m].set(j);
				}
			}
			else
			{
				login[m][n] = t - 540;
			}
		}
		int q;
		cin >> q;
		for(int i = 0; i < q; ++i)
		{
			int ts, te, m;
			cin >> ts >> te >> m;
			int count = 0;
			for(int j = ts - 540; j < te - 540; ++j)
			{
				if(used[m][j])
				{
					++count;
				}
			}
			cout << count << endl;
		}
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
typedef long long i64;

int main(){
    while (true) {
        int N,M;
        cin >> N >> M;
        if(N==0 && M==0) break;
        map<pair<int, int>, vector<int> > history;
        map<int, vector<pair<int, int> > > calcedHistory;
        int r;
        cin >> r;
        rep(i,r){
            int t,n,m,s;
            cin >> t >> n >> m >> s;
            pair<int, int> userandpc = make_pair(m,n);
            if(s==1){
                if(history.find(userandpc)==history.end()){
                    vector<int> vec;
                    vec.push_back(t);
                    history[userandpc]=vec;
                }else{
                    history[userandpc].push_back(t);
                }
                // cout << "student : " << m << " pc : " << n << " set start time at " << t << endl;
            }else{
                // cout << "student : " << m << " pc : " << n << " set end time at " << t << endl;
                int firstTime = history[userandpc].back();
                bool a= true;
                for(int i=0;i<calcedHistory[m].size();i++){
                    pair<int, int> p = calcedHistory[m][i];
                    // cout << "stacked : " << p.first << "~" << p.second << endl;
                    if(p.first<t && p.second>firstTime){
                        calcedHistory[m][i].first=min(p.first,firstTime);
                        calcedHistory[m][i].second=max(p.second,t);
                        a=false;
                        // cout << "changed to " << calcedHistory[m][i].first << "~" << calcedHistory[m][i].second << endl;
                        break;
                    }
                }
                if(a) calcedHistory[m].push_back(make_pair(firstTime,t));
                history[userandpc].pop_back();
            }
        }

        int q;
        cin >> q;
        rep(i,q){
            int ts,te,m;
            cin >> ts >> te >> m;
            int ans=0;
            for(pair<int, int> timepair : calcedHistory[m]){
                if(timepair.second>ts&&te>timepair.first){
                    ans+=min(timepair.second,te)-max(timepair.first,ts);
                }
            }
            cout << ans << endl;
        }
    }
    return 0;
}