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>
#define REP(i, a, n) for(int i = (a); i <= (n); i++)
using namespace std;

int N, M, R, RT[1001], RN[1001], RM[1001], RS[1001], Q, p[1261], q[1001];

int main(void) {
  while(cin >> N >> M, N || M) {
    cin >> R;
    REP(i, 1, R) cin >> RT[i] >> RN[i] >> RM[i] >> RS[i];
    cin >> Q;
    REP(i, 1, Q) {
      int ts, te, m; cin >> ts >> te >> m;
      REP(j, 1, 1260) p[j] = 0;
      REP(j, 1, R) {
        if(RM[j] != m) continue;
        if(RS[j] == 1) q[RN[j]] = RT[j];
        if(RS[j] == 0) REP(k, q[RN[j]], RT[j] - 1) p[k] = 1;
      }
      int u = 0;
      REP(j, ts, te - 1) if(p[j]) u++;
      cout << u << endl;
    }
  }

  return 0;
}

C++: #include <iostream>
#include <stack>
#include <queue>

using namespace std;

int main()
{
    bool flagflag=true;
    int N,M;
    while(cin>>N>>M){
        if(N==0&&M==0)break;
        
        int r;
        cin>>r;
        int data[1000][4];
        for(int i=0; i<r; i++){
            int tt,nn,mm,ss;
            cin>>tt>>nn>>mm>>ss;
            data[i][0]=tt;
            data[i][1]=nn;
            data[i][2]=mm;
            data[i][3]=ss;
            
        }
        
        int q;
        cin>>q;
        for(int roop=0; roop<q; roop++){
            int ts,te,mm;
            cin>>ts>>te>>mm;
            int start=ts;
            int ret=0;
            bool in_flag=false;
            
            queue<int> qu;
            
            for(int i=0; i<r; i++){
                if(data[i][0]>te)break;
                if(data[i][2]==mm){//dataが対象人物
                    in_flag=true;
                    if(data[i][3]==1){//ログインなら
                        if(qu.empty()){
                            start=data[i][0];
                            if(start<ts)start=ts;
                            

                        }
                        qu.push(data[i][1]);
                    }else{//ログアウトなら
                        int qusize=(int)qu.size();
                        for(int j=0; j<qusize; j++){
                            int pc = qu.front();
                            qu.pop();
                            if(pc==data[i][1])break;
                            else qu.push(pc);
                        }
                        int end = data[i][0];
                        if(qu.empty()){
                            if(end>te)end=te;
                            if(start<end)ret+=end-start;
                        }
                    }

                }
            }
            
            if(!qu.empty()){
                if(start<te)ret+=te-start;
            }
            
            
            if(in_flag)cout<<ret<<endl;
            else cout<<0<<endl;
            
        }
    }
    
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define rrep(i,n,l) for(int i=n-1;i>=l;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a);
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int d[10010][1261];
int e[10010][1261];

int main(){
	int N,M,r;
	while(1){
		cin>>N>>M;
		if(N+M==0) break;
		cin>>r;
		memset(d,0,sizeof(d));
		memset(e,0,sizeof(e));
		int t,n,m,s;
		rep(i,0,r){
			cin>>t>>n>>m>>s;
			if(s==1){
				d[m][t]++;
			}else{
				d[m][t]--;
			}
		}
		rep(j,1,M+1){
			rep(i,541,1261){
				d[j][i]+=d[j][i-1];
			}
		}
		rep(j,1,M+1){
			rep(i,540,1261){
				if(i!=540) e[j][i]+=e[j][i-1];
				if(d[j][i]>0) e[j][i]++;
				//if(j==1 && 777<=i && i<=900) cout<<j<<" "<<i<<" "<<e[j][i]<<endl;
			}
			//cout<<endl;
		}
		int q;
		cin>>q;
		int ts,te,mm;
		rep(i,0,q){
			cin>>ts>>te>>mm;
			o(e[mm][te-1]-e[mm][ts-1]);
		}
	}
}

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

typedef pair<int,bool> P;

int main(){
  int N,M,r,q;
  int t,n,m,s;
  int ts,te;
  vector<P> log[10100];

  while(cin >> N >> M, N||M){
    for(int i=0;i<M;i++)log[i].clear();
    cin >> r;
    for(int i=0;i<r;i++){
      cin >> t >> n >> m >> s;
      log[m].push_back(P(t,s));
    }

    cin >> q;
    for(int i=0;i<q;i++){
      cin >> ts >> te >> m;

      int num = 0,ans = 0,pos = 0;
      while(pos < log[m].size() && log[m][pos].first<ts){
	if(log[m][pos].second)num++;
	else num--;
	pos++;
      }

      for(int i=ts;i<te;i++){
	while(pos < log[m].size() && log[m][pos].first==i){
	  if(log[m][pos].second)num++;
	  else num--;
	  pos++;
	}
	if(pos==log[m].size())break;

	if(num)ans++;
      }
      cout << ans << endl;
    }
  }
}