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<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<list>
#include<numeric>
#include<complex>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;
typedef vector<int> Vint;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define rep2d(i, j, n) for(i = 0;i < n;++i)for(j = i + 1;j < n;++j)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define int4(v, x, y, z) int v, x, y, z; scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z) int v, w, x, y, z; scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << x << "\n"
#define pri2(x, y) cout << x << " " << y << "\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

struct data{
  int T, S;
};
vector<data> lis[10000];

signed main(void){
  int i, j, k;
  for(int testcase = 0;testcase < 1234567;testcase++){
    while(1){
      int n, m, r, q;
      cin >> n >> m; if(!(n | m))break;
      debug(n);
      cin >> r;

      rep(i, r){
        int4(TT, NN, MM, SS);
        lis[MM - 1].pb((data){TT - 540, SS});
      }

      cin >> q;
      for(;q--;){
        int3(ts, te, M);
        M--;
        int use[720] = {0};
        rep(i, lis[M].size()){
          if(lis[M][i].S)use[lis[M][i].T]++;
          else use[lis[M][i].T]--;
        }
        rep1(i, 720)use[i] += use[i - 1];
        int res = 0;
        for(i = ts;i < te;++i)if(use[i - 540])++res;
        pri(res);
      }
      rep(i, 10000)lis[i].clear();
    }


/*/

//*/ break;
  }
  return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>

#define el endl
#define fd fixed
#define INF INT_MAX/2-1
#define pb push_back

using namespace std;

class Record
{
public:
  int t;
  int n;
  int m;
  int s;
};

int main() {
  int N, M, r, t, n, m, s, q, st, et, st_tmp;
  while (cin >> N >> M, N | M) {
    cin >> r;
    Record records[r];
    for (int i = 0; i < r; i++) {
      cin >> t >> n >> m >> s;
      records[i].t = t;
      records[i].n = n;
      records[i].m = m;
      records[i].s = s;
    }
    cin >> q;
    while (q--) {
      cin >> st >> et >> m;
      int i = 0, cnt = 0, ut = 0;
      for (int time = 540; time <= 1260; time++) {
        if (records[i].t == time) {
          if (records[i].m == m) {
            if (records[i].s) {
              if (cnt == 0) {
                if (time < st) {
                  st_tmp = st;
                } else if (et <= time) {
                  continue;
                } else {
                  st_tmp = time;
                }
              }
              cnt++;
            } else {
              cnt--;
              if (cnt == 0) {
                if (time <= st) {
                  continue;
                } else {
                  ut += time - st_tmp;
                }
              }
            }
          }
          i++;
        }
        if (time == et && cnt > 0) {
          ut += et-st_tmp;
          break;
        }
      }
      cout << ut << el;
    }
  }
}

C++: #include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n,m;
int tbl[10001][1300];
int main(){
  while(cin>>n>>m,n||m){
    memset(tbl,0,sizeof(tbl));
    int r;
    cin >> r;
    for(int i=0;i<r;++i){
      int t,a,b,s;
      cin >> t >> a >> b >> s;
      if(s)
	tbl[b][t]++;
      else
	tbl[b][t]--;
    }
    for(int i=0;i<=m;++i){
      for(int j=1;j<1300;++j) tbl[i][j]+=tbl[i][j-1];
    }
    int q;
    cin >> q;
    for(int i=0;i<q;++i){
      int s,t,a;
      cin >> s >> t >> a;
      int cnt = 0;
      for(int j=s;j<t;++j){
	if(tbl[a][j]) ++cnt;
      }
      cout << cnt << endl;
    }
  }
  return 0;
}