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 1
# include <iostream>
# include <numeric>
# include <string>
# include <bitset>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <string>
# include <ctime>
# include <set>
# include <map>
# include <stack>
using namespace std;
//# define M_PI 3.141592
# define INF ((int)(1<<30))
# define FOR(i,n) for(int i=0;i<(int)n;i++)
# define FORI(i,k,n) for(int i=k;i<(int)n;i++)
# define toRad 2.0*M_PI/360.0
# define inin(x) int x;cin>>x;
# define all(x) x.begin(),x.end()
# define debug(x) cout<<#x<<" :"<<x<<endl;
# define rep(i,n) for(int i=0;i<(int)n;i++)
# define EPS 1e-12
# define CHECK(i,a) FOR(i,a.size())cout<<#a<<"["<<i<<"] : "<<a[i]<<endl; 
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
int dx[4] = { 0,-1,1,0 }, dy[4] = { 1,0,0,-1 };

int a[10010][1500];
bool f[10010];

int main()
{
	int n, m;
	while (cin >> n >> m&&n)
	{
		FOR(i, 10001)
		{
			FOR(j, 1500)a[i][j] = 0;
			f[i] = false;
		}
		int r; cin >> r;
		FOR(i, r)
		{
			int T, N, M, S;
			cin >> T >> N >> M >> S;
			if (S == 0)
			{
				S = -1;
				//T++;
			}
			a[M][T] += S;
		}
		int q; cin >> q;
		FOR(i, q)
		{
			int st, en, x;
			cin >> st >> en >> x;
			if (!f[x])
			{
				for (int j = 1; j < 1500; j++)
				{
					a[x][j] += a[x][j - 1];
				}
				f[x] = true;
			}
			int ans = 0;
			for (int j = st; j < en; j++)if (a[x][j])ans++;
			cout << ans << endl;
		}

	}
}

C++: #include <iostream>
#include <algorithm>
#define R 1001
using namespace std;

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

		//rの入力
		int r, t[R], n[R], m[R], s[R], q, ts, te, qm;
		fill(t, t + R, 0);
		fill(n, n + R, 0);
		fill(m, m + R, 0);
		fill(s, s + R, 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[1300];
			int pc[1300];
			fill(tm, tm + 1300, 0);
			fill(pc, pc + 1300, 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++){
				counter += tm[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<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,flg1=0,flg2=0;
		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;
			flg1=0;
			if(ts<rec[0][0])flg1=1;
			if(te>rec[r-1][0])te=rec[r-1][0];
			for(j=0;rec[j][0]<ts;j++){
				if(rec[j][2]!=m)continue;
				if(flg1==1){
					ts=rec[j][0];flg1=0;
				}
				if(rec[j][3]==1){
					in++;
				}else if(rec[j][3]==0){
					in--;
				}
			}
			if(in>0){
				start=ts;
			}else{
				start=te;
			}
			for(;rec[j][0]<te;j++){
				if(rec[j][2]!=m)continue;
				if(flg1==1){
					ts=rec[j][0];flg1=0;start=ts;
				}
				if(rec[j][3]==1&&in!=0){
					in++;
				}else if(rec[j][3]==1&&in==0){
					start=rec[j][0];
					in++;
				}else if(rec[j][3]==0&&in==1){
					in--;
					sum+=rec[j][0]-start;
					start=te;
				}else{
					in--;
				}
			}
			sum+=(te-start);
			cout<<sum<<endl;
		}
	}

    return 0;
}