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 <cstring>
using namespace std;

typedef vector<int> V;

typedef struct{
  int t,n,m,s;
} Record;

int main(){
  int n,m,r,q;
  
  while(cin >> n >> m ,n + m){
    const int MAX = 1260-540;

    cin >> r;
    Record d[r];
    int cnt[m+1][MAX+1];
    int use[m+1][n+1];

    memset(use,0,sizeof(use));
    memset(cnt,0,sizeof(cnt));

    for(int i = 0 ; i < r ; i++){
      cin >> d[i].t >> d[i].n >> d[i].m >> d[i].s;
      if(d[i].s){
	use[d[i].m][d[i].n] = d[i].t;
      }
      else{
	for(int j = use[d[i].m][d[i].n] ; j < d[i].t ; j++){
	  cnt[d[i].m][j-540] = 1;
	}
      }
    }

    int ts,tt,sn;
    cin >> q;
    for(int i = 0 ; i < q ; i++){
      cin >> ts >> tt >> sn;

      int ans = 0;
      for(int i = ts ; i < tt ; i++){
	if(cnt[sn][i-540]) ans++;
      } 
      cout << ans << endl;
    }
  }

  return 0;
}

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(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;

            }

            cout << ans << endl;
        }
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <map>
#include <algorithm>

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

using namespace std;

int main() {
  while(1){
    int N,M;
    cin>>N>>M;
    if(!N)break;
    int r;
    cin>>r;
    vector<vector<int>> v(M,vector<int>(1300));
    REP(i,r){
      int t,n,m,s;
      cin>>t>>n>>m>>s;
      --m;
      if(s) ++v[m][t];
      else --v[m][t];
    }
    vector<vector<int>> sum(M,vector<int>(1301));
    REP(i,M) partial_sum(begin(v[i]),end(v[i]),begin(sum[i]));
    int q;
    cin>>q;
    REP(i,q){
      int ts,te,m;
      cin>>ts>>te>>m;
      --m;
      int tu=0;
      for(int j=ts;j<te;++j){
        if(sum[m][j])
          ++tu;
      }
      cout<<tu<<endl;
    }
  }
  return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;

int n[1001][723]={};
int main(){

int N,M;
while(1){
cin>>N>>M;if(N==0&&M==0)break;
int r;
cin>>r;

for(int i=0;i<=M;i++)
for(int j=0;j<722;j++)
n[i][j]=0;

for(int i=0;i<r;i++)
{int t,x,m,w;
cin>>t>>x>>m>>w;
t-=540;
if(w==1)n[m][t]+=1;
else{n[m][t]-=1;}
}
for(int i=0;i<=M;i++)
for(int j=0;j<721;j++)
n[i][j+1]+=n[i][j];


int q,t1,t2,y;
cin>>q;


for(int i=0;i<q;i++){
cin>>t1>>t2>>y;
t1-=540;t2-=540;
int c=0;
for(int j=t1;j<t2;j++)
{
	if(n[y][j]!=0){c++;}//cout<<j+540<<" "<<c<<n[y][j]<<endl;}
}
cout<<c<<endl;
}
}
return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;

int n[10001][723]={};
int main(){

int N,M;
while(1){
cin>>N>>M;if(N==0&&M==0)break;
int r;
cin>>r;

for(int i=0;i<=M;i++)
for(int j=0;j<722;j++)
n[i][j]=0;

for(int i=0;i<r;i++)
{int t,x,m,w;
cin>>t>>x>>m>>w;
t-=540;
if(w==1)n[m][t]+=1;
else{n[m][t]-=1;}
}
for(int i=0;i<=M;i++)
for(int j=0;j<721;j++)
n[i][j+1]+=n[i][j];


int q,t1,t2,y;
cin>>q;


for(int i=0;i<q;i++){
cin>>t1>>t2>>y;
t1-=540;t2-=540;
int c=0;
for(int j=t1;j<t2;j++)
{
	if(n[y][j]!=0){c++;}//cout<<j+540<<" "<<c<<n[y][j]<<endl;}
}
cout<<c<<endl;
}
}
return 0;
}