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 <bits/stdc++.h>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;
 
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
 
const ll MOD=1e9+7;
const ll INF=1e18;
 
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};


int data[1005][4];

int main(){
    int n,m,r,q;
    while(true){
        cin >> n >> m;
        if(n + m == 0) break;
        cin >> r;
        for(int i = 0;i < r;i++){
            for(int j = 0;j < 4;j++){
                cin >> data[i][j];
            } 
        }
        vector<P> use[10005];
        for(int i = 0;i < r;i++){
            if(data[i][3] == 0) continue;
            for(int j = i+1;j < r;j++){
                if(data[i][1] == data[j][1] && data[i][2] == data[j][2]){
                    use[data[i][2]].push_back(P(data[i][0],data[j][0]));
                    break;
                }
            }
        }
        cin >> q;
        for(int i_ = 0;i_ < q;i_++){
            int a,b,stu,st,en;
            cin >> st >> en >> stu;
        //    cout << "st:" << st << ", en:" << en << endl;
            int ans = 0;

            for(int i = 0;i < use[stu].size();i++){
                a = use[stu][i].fs; b = use[stu][i].sc;
       //         cout << a << " " << b << endl;
                if(b <= st){ //1
                    continue;
                }else if(a <= st && b > st && b < en){ //2
                    ans += b - st;
                    st = b;
                }else if(a <= st && b >= en){ //3
                    ans += en - st;
                    break;
                }else if(a >= st && b < en){ // 4
                    ans += b - a;
                    st = b;
                }else if(a < en && b >= en){ // 5
                    ans += en - a;
                    break;
                }else{ // 6
                    break;
                }
            }
            cout << ans << endl;
        }

    }
}

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

int students[10001][750] = {};
int numlogin[10001] = {};
int sum[10001][800]={};

int main(){

  while(1){
    int N,M,r;
    cin >> N >> M;
    if(!N and !M) break;
    cin >> r;

    memset(students,0,sizeof(students));
    memset(numlogin,0,sizeof(numlogin));
    memset(sum,0,sizeof(sum));

    // ?¨????
    for(int i=0; i<r; i++){ // 1000
      int t,n,m,s;
      cin >> t >> n >> m >> s;
      t -= 540;
      if(s == 0) { // ?????°??¢??????
	numlogin[m]--;
	if(numlogin[m] == 0){
	  for(int i=t-1; students[m][i] != 1 and t>=0; i--){ // 1000
	    students[m][i] = 1;
	  }
	}
      }
      else{ // ?????°??????
	numlogin[m]++;
	if(numlogin[m] == 1)
	  students[m][t] = 1;
      }
    }

    // ?´???????
    for(int i=1; i<=M; i++){ // 100000
      for(int j=1; j<=720; j++){ // 1000
	sum[i][j] = sum[i][j-1] + students[i][j]; 
      }
    }

    // ??????
    int  q;
    cin >> q;
    for(int i=0; i<q; i++){
      int ts,te,id;
      cin >> ts >> te >> id;
      ts -= 540;
      te -= 540;
      cout << sum[id][te-1] - sum[id][ts] + students[id][ts] << endl;
    }
  }
}

C++: #include "bits/stdc++.h"
using namespace std;
bool use[10000][1260]; //[i][j]:??????i?????????j~j+1???PC????????¨????????????
int login[1000]; //[i]:-1?????¨???????????°?????????????????? ????????\????????¨???????????°??????????????????
int main() {
	int N,M,r,q;
	while(scanf("%d %d",&N,&M),N) {
		memset(use,0,sizeof(use));
		scanf("%d",&r);
		for(int i=0;i<r;i++) {
			int t,n,m,s;
			scanf("%d %d %d %d",&t,&n,&m,&s);n--;m--;
			if(s) {
				login[n]=t;
			} else {
				for(int j=login[n];j<t;j++) use[m][j]=1;
			}
		}
		scanf("%d",&q);
		for(int i=0;i<q;i++) {
			int ts,te,m;
			scanf("%d %d %d",&ts,&te,&m);m--;
			int ans=0;
			for(int j=ts;j<te;j++) {
				if(use[m][j]) ans++;
			}
			printf("%d\n",ans);
		}
	}
}

C++: #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<functional>
#include<map>
#include<set>
#include<math.h>

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

using namespace std;

int n,m;

//時刻,学生
int data[1300][10003];

void solve() {
	rep(i,1300) rep(j,10003) data[i][j]=0;
	int r;
	cin>>r;
	rep(i,r) {
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		if(d==1) {
			data[a][c]++;
		}
		else {
			data[a][c]--;
		}
	}

	rep(i,m+1) {
		for(int j=1;j<1300;j++) {
			data[j][i]+=data[j-1][i];
		}
	}

	int q;
	cin>>q;
	rep(i,q) {
		int a,b,c;
		cin>>a>>b>>c;
		int ans=0;
		for(int j=a;j<b;j++) {
			if(data[j][c]!=0) {
				ans++;
				//printf("[debug] %d,%d = %d\n",j,c,data[j][c]);
			}
		}
		//cout<<"ans="<<ans<<endl;
		cout<<ans<<endl;
	}

}

int main() {

	while (cin>>n>>m)
	{
		if(n+m==0) {
			return 0;
		}
		solve();
	}

	return 0;
}