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 <cstdio>
#include <vector>
#include <map>

using namespace std;
#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,b) loop(i,0,b)

int main(){
    int N,M;
    while(scanf("%d%d",&N,&M)!=EOF && N|M){
        typedef pair<int,int> pii;
        typedef vector<pii> vp;
        typedef vector<vp> vvp;
        typedef vector<vvp> vvvp;
        vvvp v(N+1,vvp(M+1));
        int r;scanf("%d",&r);
        rep(i,r){
            int t,n,m,s;
            scanf("%d%d%d%d",&t,&n,&m,&s);
            if(s){
                v[n][m].emplace_back(t,0);
            }else{
                v[n][m].back().second = t;
            }
        }

        int q;scanf("%d",&q);
        rep(i,q){
            int s,e,m;
            int ans=0;
            scanf("%d%d%d",&s,&e,&m);
            bool use[2000]={};
            loop(j,1,N+1)rep(k,v[j][m].size()){
                auto t=v[j][m][k];
                if(e<t.first || t.second<s) continue;
                int E=min(t.second,e);
                int S=max(t.first,s);
                if(S>E)continue;
                loop(w,S,E)use[w]=true;
                // printf("%d %d %d %d\n",S,E,m,x);
            }
            rep(j,2000)if(use[j])ans++;
            cout<<ans<<endl;
        }
    }
}

C++: #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <fstream>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
typedef long long ll;

#define INF 1000000000
#define ST 540

short t[1000][1000];

int main(){
    int n,m;
    while(cin>>n>>m, n|m){
        fill(t[0],t[1000], 0);
        int r;
        cin>>r;
        rep(i,r){
            int ti,a,b,s;
            scanf("%d %d %d %d\n", &ti, &a, &b, &s);
            if(s==0) t[b-1][ti-ST] += -1;
            else t[b-1][ti-ST] += 1;
        }

        // imosu
        rep(i,1000){
            rep(j,800){
                t[i][j+1] += t[i][j];
            }
        }

        int q;
        cin>>q;
        rep(i,q){
            int s,e,a;
            scanf("%d%d%d",&s,&e,&a);
            s-=ST; e-=ST;
            int res=0;
            for(int j=s; j<e; j++){
                if(t[a-1][j]>0) res++;
            }
            cout<<res<<endl;
        }
    }
    return 0;
}

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

typedef pair<int, int> P;

vector<P> p[10001];
int c[10001][2];
int N, M, R, Q;

int main()
{
 loop:
  for(int i = 0; i < 10001; i++)
  {
    c[i][0] = -1;
    c[i][1] = 0;
    p[i].clear();
  }
  cin >> N >> M;
  if(!N)
    return 0;
  cin >> R;
  for(int i = 0; i < R; i++)
  {
    int t, n, m, s;
    cin >> t >> n >> m >> s;
    if(s)
    {
      if(c[m][0] == -1)
        c[m][0] = t;
      c[m][1]++;
    }
    else
    {
      if(!(--c[m][1]))
      {
        p[m].push_back(make_pair(c[m][0], t));
        c[m][0] = -1;
      }
    }
  }
  cin >> Q;
  for(int i = 0; i < Q; i++)
  {
    int ts, te, m, a = 0;
    cin >> ts >> te >> m;
    for(auto e: p[m])
    {
      if(e.second < ts || te < e.first)
        continue;
      if(ts <= e.first && e.second <= te)
        a += e.second - e.first;
      else if(ts <= e.first)
        a += te - e.first;
      else
        a += e.second - ts;
    }
    cout << a << endl;
  }
  goto loop;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define fordebug int hoge;cin>>hoge;
int a[10005][2000];
int main(){
  while(1){
    int n,m;
    cin>>n>>m;
    if(n==0&&m==0) break;
    int r;
    cin>>r;
    lp(i,r){
      int t,nn,mm,s;
      cin>>t>>nn>>mm>>s;
      if(s==0) a[mm][t-1]=-1; 
      else a[mm][t]=s;
    }
    lp(i,n){
      for(int j=1;j<2000;j++){
	a[i][j]+=a[i][j-1];
      }
    }
    int q;
    cin>>q;
    lp(i,q){
      int x,y,z;
      cin>>x>>y>>z;
      int count=0;
      for(int j=x;j<=y;j++){
	if(a[z][j]!=0) count++;
      }
      cout<<count<<endl;
    }
    lp(i,m+1){
      lp(j,2000){
	a[i][j]=0;
      }
    }
  }
  return 0;
}

C++: #include <iostream>

using namespace std;
#define max 1260-540

bool time[10000][max+1];

int main(void){
	int N,M,r,q;
	while(cin >> N  >> M, N|M){
		for(int i=0;i<M;i++)
			for(int j=0;j<=max;j++)
				time[i][j]=false;

		cin >> r;
		int start[1001];
		for(int i=0;i<r;i++){
			int t,n,m,s;
			cin >> t >> n >> m >> s;
			if(s)
				start[n]=t-520;
			else{
				for(int k=start[n];k<t-520;k++)
					time[m][k]=true;
			}
		}
		cin >> q;
		for(int i=0;i<q;i++){
			int ts,te,m;
			cin >> ts >> te >> m;
			int num=0;
			for(int i=ts-520;i<te-520;i++){
				if(time[m][i])
					num++;
			}
			cout << num << endl;
		}
	}

	return 0;
}