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 <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;

#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define pi 3.14159265359
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

const int st_num = 100005;
int st_nowpc[st_num];
int st_lastin[st_num];
vector<pair<int,int> > st_GatData[st_num];
int main(){
	while(1){
		REP(i,st_num){
			st_nowpc[i] = 0;
			st_GatData[i].clear();
		}
		int N,M;
		int r;
		cin >> N >> M;
		if(N==0&&M==0) break;
		cin >> r;
		REP(i,r){
			int t,n,m,s;
			cin >> t >> n >> m >> s;
			if(s==1) {
				if(st_nowpc[m]==0) {
					st_lastin[m] = t;
				}
				st_nowpc[m]++;
			}
			if(s==0){
				st_nowpc[m]--;
				if(st_nowpc[m]==0){
					st_GatData[m].pb(make_pair(st_lastin[m],t));
				}
			}
		}
		int q;
		cin >> q;
		REP(i,q){
			int ts,tm,m;
			cin >> ts >> tm >> m;
			ll int sum = 0;
			REP(j,st_GatData[m].size()){
				int sttime = max(st_GatData[m][j].first,ts);
				int endtime = min(st_GatData[m][j].second,tm);
				//if(sttime!=ts||endtime!=tm) 
				sum+=(endtime-sttime);
			}
			cout << sum << endl;
		}
	}

}

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

int main()
{
  int N,M,r,q,t,n,m,s,S[10000][1261]={},ts,te,time;

  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=0;i<M;i++){
      for(int j=539;j<=1260;j++)S[i][j]=0;
    }
    cin>>r;
    for(int i=0;i<r;i++){
      cin>>t>>n>>m>>s;
      if(s==1)S[m-1][t]=1;
      else S[m-1][t]=-1;
    }
    for(int i=0;i<M;i++){
      for(int j=539;j<=1260;j++){
        S[i][j]+=S[i][j-1];
      }
    }
    cin>>q;
    for(int i=0;i<q;i++){
      cin>>ts>>te>>m;
      time=0;
      for(int j=ts;j<te;j++){
	if(S[m-1][j]>0)time++;
      }
      cout<<time<<endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <cstring>
#define rep(i,a,b) for(int i=(a); i<(b); i++)

using namespace std;
int N , M;

typedef struct data {
  data(int time , int pc) : time(time) , pc(pc){}
  int time , pc;
} data;

int main(){
  while(cin >> N >> M , N + M){
    vector<data> personal_logs[10001];
    int r; cin >> r;
    rep(i, 0, r){
      int time, pc, user, s;
      cin >> time >> pc >> user >> s;
      personal_logs[user].push_back(data(time , pc));
    }
    
    int q; cin >> q;
    rep(i, 0, q){
      int ts, te, user;
      cin >> ts >> te >> user;
      
      int last_login[10001];
      memset(last_login , -1 , sizeof(last_login));
      
      int ans = 0;
      rep(j, 0, personal_logs[user].size()){
        int pc = personal_logs[user][j].pc;
        if(last_login[pc] == -1){
          last_login[pc] = personal_logs[user][j].time;
        } else {
          int login = last_login[pc];
          int logout = personal_logs[user][j].time;
          int b = 0, e = 0;
          int s = -1;
          if(login <= ts && ts <= logout && logout <= te){
            e = logout; b = ts; s = 0;
          } else if(ts <= login && logout <= te){
            e = logout; b = login; s = 1;
          } else if(ts <= login && login <= te && te <= logout){
            e = te; b = login; s = 2;
          } else if(login <= ts && te <= logout){
            e = te; b = ts; s = 3;
          }
          ans += e - b;
          cout << s << " " << b << " " << e << " " << e-b << endl;
          last_login[pc] = -1;
        }
      }
      cout << ans << endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;

class Solver {
};

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

		vector<vector<int>> range(m, vector<int>(2000, 0));
		int r;
		cin >> r;
		for (int i = 0; i < r; i++) {
			int ti, ni, mi, si;
			cin >> ti >> ni >> mi >> si;
			if (si == 0)range[mi - 1][ti]--;
			else range[mi - 1][ti]++;
		}

		for (int i = 0; i < m; i++) {
			for (int j = 1; j < 2000; j++) {
				range[i][j] += range[i][j - 1];
			}
		}

		int q;
		cin >> q;
		for (int i = 0; i < q; i++) {
			int ts, te, mi;
			cin >> ts >> te >> mi;
			int res = 0;
			for (int j = ts; j < te; j++) {
				if (range[mi - 1][j] > 0)res++;
			}
			cout << res << endl;
		}
	}
}