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

typedef struct{
  int time;
  bool inout;
} Data;

int main(){
  int n,m;
  while(cin>>n>>m,n){
    int r,q;
    Data data;
    vector<vector<Data> > vec(m);
    cin>>r;
    for(int i=0;i<r;i++){
      int t,pc,number,check;
      cin>>t>>pc>>number>>check;
      data.time=t;
      data.inout=(bool)check;
      vec[number-1].push_back(data);
    }
    cin>>q;
    for(int i=0;i<q;i++){
      int ts,te,number;
      cin>>ts>>te>>number;
      number--;
      int time=ts;
      int check=0;
      int sum=0;
      for(int i=0;i<(int)vec[number].size();i++){
	data = vec[number][i];
	if(data.inout) check++;
	else check--;
	if(ts <= data.time && data.time <= te){
	  if(data.inout && check == 1) time=data.time;
	  if(!data.inout&& check == 0){ 
	    sum += data.time-time;
	    time=data.time;
	  }
	}
	if(!data.inout && data.time > te){
	  sum+=te-time;
	  break;
	}
	if(data.inout && data.time > te) break;
      }
      cout<<sum<<endl;
    }
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int (i)=0;(i) < (N); (i)++)

int main(){
    int N,M;
    const int T_MAX = 1260;
    const int T_MIN = 540;
    while(cin >> N >> M, N != 0){
        int r;
        cin >> r;
        vector<vector<int>> timeTable(M+1, vector<int>(T_MAX+2, 0));
        rep(i,r){
            int t, n, m, s;
            cin >> t >> n >> m >> s;
            int stamp = (s == 1 ? 1 : -1);
            timeTable[m][t] += stamp;
        }

        for(int m = 1;m <= M; m++){
            for(int t = T_MIN + 1; t <= T_MAX; t++){
                timeTable[m][t] += timeTable[m][t - 1];
            }
        } 

        int q;
        cin >> q;
        rep(i,q){
            int ts, te, m;
            cin >> ts >> te >> m;
            int res = 0;
            int seg = 0;

            for(int t = ts; t <= te; t++){
                res += !!(timeTable[m][t]);
            }
            seg += !!(timeTable[m][te]);
            res -= seg;

            cout << res << endl;
        }
    }
}

C++: #include<bits/stdc++.h>
using namespace std;

#define MAX 110

int main(){

  while(1){
    int N,M, r, q, time[MAX][2000] = {};
    int t, n, m, s, ts, te;
    cin>>N>>M;
    if(!N&&!M)break;
    cin>>r;
    for(int i = 1; i <= r; i++){
      cin>>t>>n>>m>>s;
      if(!s){
	time[n][t+1] -= m;
      }else {
	time[n][t] += m;
      }
    }

    for(int j = 540; j <= 1260; j++){
      for(int k = 1; k <= N; k++){//cout<<time[k][j]<<" ";cout<<endl;
	time[k][j] += time[k][j-1];
      }
    }
   /* for(int j = 780; j <= 870; j++){cout<<j<<" ";
      for(int k = 1; k <= N; k++)cout<<time[k][j]<<" ";cout<<endl;
    }*/
 
    cin>>q;
    for(int i = 1; i <= q; i++){
      int ans = 0, temp = 0;
      cin>>ts>>te>>m;
      for(int j = ts; j <= te; j++){
	for(int k = 1; k <= N; k++){
	  int l = j;
	  if(time[k][j] == m){//cout<<k<<" "<<j<<" "<<m<<endl;
	    while(time[k][l] && l <= te)l++;
	    ans += l-j-1; //cout<<ans<<" "<<l<<" "<<j<<endl;
	    if(m == time[k][j-1] && j-1 >= ts)ans++; 
	    j = l-1;
	   // temp = j;
	    break;
	  }
	}
      }
      cout<<ans<<endl;
    }
  }

  return 0;
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int login[1010][2000];

int main() {
	int N,M;
	while(cin>>N>>M,N){
		int r,q;
		cin>>r;
		int i;
		memset(login,0,sizeof(login));
		for(i=0;i<r;i++){
			int t,n,m,s;
			cin>>t>>n>>m>>s;
			login[m][t]+=(s?1:-1);
		}
		int j;
		int l;
		for(j=0;j<=M;j++){
			l=0;
			for(i=540;i<=1260;i++){
				l+=login[j][i];
				login[j][i]=l;
//cout<<j<<" "<<i<<" "<<l<<endl;
			}
		}
		cin>>q;
		for(i=0;i<q;i++){
			int ts,te,m;
			cin>>ts>>te>>m;
			int res=0;
			for(j=ts;j<te;j++){
				if(login[m][j]>0)res++;
			}
			cout<<res<<endl;
		}
	}
	return 0;
}

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

struct Record{

  int s_cnt,e_cnt;
  int s[501],e[501];
  
};

int main(){

  int N,M;
  int r,q,t,n,m,s;
  int t_s,t_g;
  int table[721];
  Record student[10001];
  
  while(1){
    
    cin >>N>>M;
    if(N==0 && M==0)break;
    
    for(int i=0 ; i < M+1 ; i++){
      student[i].s_cnt=0;
      student[i].e_cnt=0;
    }
    
    cin >>r;
    for(int i=0 ; i < r ; i++){
      cin >>t>>n>>m>>s;
      if(s == 1){
	student[m].s[student[m].s_cnt]=t;
	student[m].s_cnt++;
      }else{
	student[m].e[student[m].e_cnt]=t;
	student[m].e_cnt++;
      }
    }
    
    cin >>q;
    for(int i=0 ; i < q ; i++){
      cin >>t_s>>t_g>>m;
      for(int j=0 ; j < 721 ; j++)table[j]=0;
      for(int j=0 ; j < student[m].s_cnt ; j++){
	for(int k=student[m].s[j]-540 ; k < student[m].e[j]-540 ; k++){
	  table[k]=1;
	}
      }
      int sum=0;
      for(int j=t_s-540 ; j < t_g-540  ; j++)sum+=table[j];
      cout <<sum<<endl;
    }
    
  }
  
  return 0;
}