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 <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <set>
#include <map>
//#include <bits/stdc++.h>

#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
#define bl bool
#define nn printf("\n");
#define mod 1000000007

using namespace std;

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, M; while (cin >> N >> M && N != 0 && M != 0)
	{
		int r; cin >> r;
		vector<vector<vector<int>>> dat(M + 2, vector<vector<int>>(N + 2, vector<int>(722, 0)));
		vector<vector<int>> ttmp(M + 2, vector<int>(N + 2, 0));
		rep(i, r)
		{
			int t, n, m, s; cin >> t >> n >> m >> s;
			if (s == 1){ ttmp[m][n] = t - 540; }
			else if (s == 0) { fill(dat[m][n].begin() + ttmp[m][n], dat[m][n].begin() + (t - 540), 1); }
		}
		int q; cin >> q;
		rep(i, q)
		{
			int ts, te, m; cin >> ts >> te >> m;
			int ans = 0;
			for (int j = ts - 540; j < te - 540; j++)
			{
				int tmp = 0;
				rep(k, N + 1)
				{
					if (dat[m][k][j] == 1) { tmp++; }
				}
				if (tmp > 0) { ans++; }
			}
			printf("%d\n", ans);
		}
	}
	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio> 
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rangeRep(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
struct Student {
	int t, n, m, s;
};

constexpr int timeOffset = 540;
//[PC][??????] = ????????????
int dp[1000][1260 - timeOffset] = { 0 };


class Solve {
public:
	Solve() {};
	~Solve() {};

	void solver() {
		std::vector<std::vector<int>> results;
		while (1) {
			int n, m, r, q;
			std::vector<Student> students;
			std::cin >> n >> m;
			if (!n) break;

			std::memset(dp, 0, sizeof(dp));
			
			results.push_back(std::vector<int>());
			//?????°???????????±
			std::cin >> r;
			Student s;
			rep(i, r) {
				//??????, PC??????, ????????????, isLogin
				std::cin >> s.t >> s.n >> s.m >> s.s;
				//?????°??????
				if (s.s) {
					//?????°??????????§???????????????????
					dp[s.n - 1][s.t - timeOffset] = s.m;
				}//?????°??¢??????
				else {
					//?????°????????¨????????§?????£?????????
					int time = s.t - timeOffset - 1;
					do{
						dp[s.n - 1][time--] = s.m;
					} while (dp[s.n - 1][time] == 0);
				}
			}

			//?????? [ts, te]??????????????????m????????¨??????
			std::cin >> q;
			rep(i, q) {
				int num = 0;
				int ts, te, m;
				std::cin >> ts >> te >> m;
				ts -= timeOffset; te -= timeOffset;
				//???????????????PC??§?????°?????????????????????????????????
				rangeRep(j, ts, te) {
					rep(k, 1000) {
						if (dp[k][j] == m) {
							num++;
							break;
						}
					}
				}
				results.back().push_back(num);
			}
		}

		for (auto& x : results) {
			for (auto& y : x) {
				std::cout << y << std::endl;
			}
		}
	}
private:

};

int main() {
	Solve solve;
	solve.solver();
	getchar(); getchar();
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<P,P> PP;
const ll MOD=10000;
const ll INF=1000000010;
const int MAX=100001;
int dx[8]={0,1,0,-1,1,-1,1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
int sum[10010][1300];
int main(){
	int N,M;
	while(cin>>N>>M,N){
		memset(sum,0,sizeof(sum));
		int r;
		cin>>r;
		for(int i=0;i<r;i++){
			int t,n,m,s;
			cin>>t>>n>>m>>s;m--;
			if(s){
				sum[m][t]++;
			}else{
				sum[m][t]--;
			}
		}
		for(int i=0;i<M;i++){
			for(int j=1;j<=1260;j++){
				sum[i][j]+=sum[i][j-1];
			}
		}	
		int q;
		cin>>q;
		while(q--){
			int t1,t2,m;
			cin>>t1>>t2>>m;m--;
			int ans=0;
			for(int i=t1;i<t2;i++){
				if(sum[m][i]>0){
					ans++;
				}
			}
			cout<<ans<<endl;
		}		
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()

const int MAXN = 1000, MAXM = 10000, MAXR = 1000, MAXQ = 50, MAXT = 1260;

int mem[MAXM + 1][MAXT + 1];

const int LOGIN = 1, LOGOUT = 0;
int main()
{
    int n, m;
    while(cin >> n >> m && n)
    {
        memset(mem, 0, sizeof(mem));
        int r; cin >> r;
        int rt, rn, rm, rs;
        REP(r)
        { 
            cin >> rt >> rn >> rm >>  rs;
            if(rs == LOGIN)
                for(int j = rt; j <= MAXT; j++) mem[rm][j] += 1;
            else
                for(int j = rt; j <= MAXT; j++) mem[rm][j] -= 1;
        }
        int q; cin >> q;
        REP(q)
        {
            int ts, te , qm;
            cin >> ts >> te >> qm;
            int ans = 0;
            
            for(int j = ts; j < te; j++)
                if(mem[qm][j] > 0) ans++;

            cout << ans << endl;
        }
                
    }
    return 0;
}