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>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265


void f(int n,int m){
  int v[1300][1100]={};
  bool e[1300]={};
  int r;
  cin>>r;
  rep(i,r){
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    e[c]=true;
    if(d==1){
      v[c][a]++;
    }
    if(d==0){
      v[c][a]--;
    }
  }

  rep(i,1300){
    if(!e[i]) continue;
    FOR(j,540,1100){
      v[i][j]+=v[i][j-1];
    }
    FOR(j,540,1100){
      v[i][j]=(v[i][j]>0);
      v[i][j]+=v[i][j-1];
    }
  }


  int q;
  cin>>q;
  rep(i,q){
    int a,b,c;
    cin>>a>>b>>c;
    cout<<v[c][b-1]-v[c][a-1]<<endl;
  }

}


int main(){
  while(1){
    int n,m;
    cin>>n>>m;
    if(n==0) break;
    f(n,m);
  }

  return 0;
}

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

int N, M, r, q;
int t[1024], n[1024], m[1024], s[1024];

vector<pair<pair<int, int>, int> > query;
bool pc_status[10010];

bool input() {
	cin >> N >> M;
	if(N == 0 && M == 0)
		return false;
	cin >> r;
	for(int i = 0; i < r; i++) {
		cin >> t[i] >> n[i] >> m[i] >> s[i];
	}
	cin >> q;
	for(int i = 0; i < q; i++) {
		int tmp_ts, tmp_te, tmp_m;
		cin >> tmp_ts >> tmp_te >> tmp_m;
		query.push_back( pair<pair<int,int> ,int>(pair<int,int>(tmp_ts, tmp_te), tmp_m) );
	}

	return true;
}

void init() {
	query.clear();
	for(int i = 0; i < 10010; i++)
		pc_status[i] = false;
}

int solve(pair<pair<int,int>,int> que) {
	vector<int> use;
	int ret = 0;
	int start = -1, end = -1;
	for(int i = 0; i < r; i++) {
		if(m[i] == que.second) {
			if(s[i] == 1) {
				if(que.first.first < t[i] && use.size() == 0)
					start = t[i];
				else if(use.size() == 0)
					start = que.first.first;
				use.push_back(i);
			}

			else {
				use.erase(use.end() - 1, use.end());
				if(start > t[i])
					end = start;
				else if(t[i] > que.first.second)
					end = que.first.second;
				else if(que.first.second > t[i] && use.size() == 0)
					end = t[i];
				else if(use.size() == 0)
					end = que.first.second;
			}

			if(use.size() == 0)
				ret += end - start;
		}
	}

	return ret;
}

int main(void) {
	while(init(), input()) {
		for(int i = 0; i < q; i++) {
			cout << solve(query[i]) << endl;
		}
	}
	return 0;
}

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]=1;
    }
    lp(i,m+1){
      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-1]==0&&a[z][j]==1&&j!=x) count--;
	if(a[z][j]!=0) count++;
	if(j==x&&a[z][j]==1) count--;
      }
      cout<<count<<endl;
    }
    lp(i,m+1){
      lp(j,2000){
	a[i][j]=0;
      }
    }
  }
  return 0;
}

C++: #include <bits/stdc++.h>

#define all(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pair;
typedef complex<double> Complex;

const double PI = M_PI;
const int INF = 1e9;

int t[10001][1261];
int x[10001][1261];

int main() {
    int n, m, tt, nn , mm, ss;
    int r;
    while(cin >> n >> m) {
        if(n == 0) break;
        cin >> r;
        memset(t, 0, sizeof t);
        memset(x, 0, sizeof x);

        for(int i = 0; i < r; i++) {
            cin >> tt >> nn >> mm >> ss;
            if(ss) {
                t[mm][tt] = 1;
            } else {
                t[mm][tt] = -1;
            }
        }

        for(int i = 0; i <= 10000; i++) {
            for(int j = 1; j <= 1260; j++) {
                t[i][j] += t[i][j-1];
                if(t[i][j] > 0) {
                    x[i][j] = 1;
                }
            }
        }

        for(int i = 0; i <= 10000; i++) {
            for(int j = 1; j <= 1260; j++) {
                x[i][j] += x[i][j-1];
            }
        }


        cin >> r;
        for(int i = 0; i < r; i++) {
            cin >> tt >> nn >> mm;
            int ans = x[mm][nn-1] - x[mm][tt-1];
            cout << ans << endl;
        }
    }
}