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 <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

int calc(int s, int e, int ts, int te) {
    int x = min(e, te) - max(s, ts);
    if(x < 0) x = 0; return x;
}

signed main() {
    int N, M;
    while(cin >> N >> M, N || M) {
        int logs[10010][1010] = {};
        vector<pii> v[10010];
        int r, t, n, m, s; cin >> r;
        rep(i,0,r) {
            cin >> t >> n >> m >> s;
            t -= 539;
            m--;
            if(s == 0) v[m].pb(pii(logs[m][n], t));
            else logs[m][n] = t;
        }

        int q; cin >> q;
        rep(i,0,q) {
            int ts, te, mm; cin >> ts >> te >> mm;
            ts -= 539; te -= 539;
            mm--;

            int ruiseki[800] = {};
            rep(j,0,v[mm].size()) {
                // printf("%lld %lld\n", v[mm][j].fr + 539, v[mm][j].sc + 539);
                ruiseki[ v[mm][j].fr     ]++;
                ruiseki[ v[mm][j].sc + 1 ]--;
            }
            int ans = 0;
            rep(j,1,800) {
                ruiseki[j] += ruiseki[j-1];
                if(ruiseki[j] && ruiseki[j-1] && ts < j && j <= te) ans++;
            }
            cout << ans << endl;
        }
    }
    return 0;
}

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

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef complex<double> P;
static const double EPS = 1e-8;
static const int INF = (int)1e8;

#define FOR(i,k,n) for (int i=(k); i<(int)(n); ++i)
#define REP(i,n) for (int i=0; i<(int)(n); ++i)
#define FOREQ(i,k,n) for (int i=(k); i<=(int)(n); ++i)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define FIND(m,w) ((m).find(w)!=(m).end())

int c[10001][1261]={};
int main(void){
  int N,M;
  while(cin>>N>>M,N&&M){
    REP(i,10001)REP(j,1261)c[i][j]=0;
    int r;
    cin>>r;
    while(r--){
      int t,n,m,s;
      cin>>t>>n>>m>>s;
      REP(time,1260){
        if(time==t){
          if(s){
            c[m][time]++;
          }else{
            c[m][time]--;
          }
        }
      }
    }
    REP(m,10001)REP(time,1260)c[m][time+1]+=c[m][time];
    
    int q; cin>>q;
    while(q--){
      int ans = 0;
      int t1,t2,m;
      cin>>t1>>t2>>m;
      for(int time = t1; time < t2; time++){
        if(c[m][time]) ans ++;
      }
      cout<<ans<<endl;
    }
  }

  return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <functional>

using namespace std;

typedef pair<int, int> P;

int main() {
	int n, m;
	while (cin >> n >> m) {
		if (n == 0 && m == 0) {
			break;
		}
		vector< vector<P> > hyou(m+1);
		vector< vector<P> > hyou2(m+1);
		vector<int> com(n+1);
		int r;
		cin >> r;
		int t, nn, mm, s;
		for (int i = 0; i < r; i++) {
			cin >> t >> nn >> mm >> s;
			if (s == 1) {
				com[nn] = t;
			} else {
				P p;
				p.first = com[nn];
				p.second = t;
				hyou2[mm].push_back(p);
			}
		}
		for (int i = 1; i < m+1; i++) {
			if (!hyou2[i].empty()) {
				priority_queue< P, vector<P>, greater<P> > pq;
				for (int j = 0; j < hyou2[i].size(); j++) {
					pq.push(hyou2[i][j]);
				}
				while (!pq.empty()) {
					P p = pq.top();
					pq.pop();
					if (hyou[i].empty()) {
						hyou[i].push_back(p);
					} else {
						if (hyou[i][hyou[i].size()-1].second < p.first) {
							hyou[i].push_back(p);
						} else if (hyou[i][hyou[i].size()-1].second > p.second) {
						} else {
							hyou[i][hyou[i].size()-1].second = p.second;
						}
					}
				}
			}
		}
		int q;
		cin >> q;
		int ts, te;
		for (int i = 0; i < q; i++) {
			cin >> ts >> te >> mm;
			int time = 0;
			if (!hyou[mm].empty()) {
				for (int j = hyou[mm].size()-1; j >= 0; j--) {
					if (hyou[mm][j].first < te) {
						if (hyou[mm][j].second > ts) {
							time += min(te, hyou[mm][j].second) - max(ts, hyou[mm][j].first);
						} else {
							break;
						}
					}
				}
			}
			cout << time << endl;
		}
	}
	return 0;
}