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 <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio> 
#include <cstring>

#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define rangeRep(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
struct Student {
	int t, n, m, s;
};

constexpr int timeOffset = 540;
//[PC][time] = Student
int dp[1000][1260 - timeOffset] = { 0 };


class Solve {
public:
	Solve() {};
	~Solve() {};

	void solver() {
		std::vector<std::vector<int>> results;
		while (1) {
			int n, m, r, q;
			std::vector<Student> students;
			std::cin >> n >> m;
			if (!n) break;

			std::memset(dp, 0, 1000 * (1260 - timeOffset) * sizeof(int));
			long long a = 1000 * (1260 - timeOffset) * sizeof(int);
			results.push_back(std::vector<int>());
			//login info
			std::cin >> r;
			Student s;
			rep(i, r) {
				//time, PC, student, isLogin
				std::cin >> s.t >> s.n >> s.m >> s.s;
				//login
				if (s.s) {
					//set login start time
					dp[s.n - 1][s.t - timeOffset] = s.m;
				}//logout
				else {
					//Fill until login start time
					int time = s.t - timeOffset - 1;
					while (dp[s.n - 1][time] == 0) {
						dp[s.n - 1][time--] = s.m;
					} 
				}
			}

			//question [ts, te]
			std::cin >> q;
			rep(i, q) {
				int num = 0;
				int ts, te, m;
				std::cin >> ts >> te >> m;
				ts -= timeOffset; te -= timeOffset;
				//Check if logged in on any PC.
				rangeRep(j, ts, te) {
					rep(k, n) {
						if (dp[k][j] == m) {
							num++;
							break;
						}
					}
				}
				results.back().push_back(num);
			}
		}

		for (auto& x : results) {
			for (auto& y : x) {
				std::cout << y << std::endl;
			}
		}
	}
private:

};

int main() {
	Solve solve;
	solve.solver();
	return 0;
}

C++: #include <iostream>
using namespace std;
 
int main() {
    int n,m,r,q,t,nn,mm,s,ts,te;
    int si[10001]={};
    int ei[10001]={};
    int pcn[10001]={};
    int lts[1000]={};
    int lte[1000]={};
    int ni[1000]={};
    while(1){
        cin >> n >> m;
        if(n==0){return 0;}
        for(int i=1;i<=m;i++){
            si[i]=-1;
            pcn[i]=0;
        }
        cin >> r;
        int pi=0;
        for(int i=0;i<r;i++){
            cin >> t >> nn >> mm >> s;
            if(mm==3212){cout << t << " " << s << endl;}
            if(s){
                pcn[mm]++;
                if(pcn[mm]==1){
                    if(si[mm]==-1){
                        si[mm]=pi;
                    }else{
                        ni[ei[mm]]=pi;
                    }
                        ei[mm]=pi;
                        lts[pi]=t;
                        ni[pi]=-1;
                        pi++;
                }
            }else{
                pcn[mm]--;
                if(pcn[mm]==0){
                    lte[ei[mm]]=t;
                }
            }
        }
        cin >> q;
        for(int i=0;i<q;i++){
            cin >> ts >> te >> mm;
            int tt=0;
            for(int j=si[mm];j!=-1;j=ni[j]){
                if(lts[j]<ts && lte[j]>=ts && lte[j]< te){
                    tt=lte[j]-ts;
                }
                if(lts[j]<ts && lte[j]>=te){
                    tt=te-ts;
                    break;
                }
                if(lts[j]>=ts && lte[j]<te){
                    tt+=lte[j]-lts[j];
                }
                if(lts[j]>=ts && lts[j]<te && lte[j]>=te){
                    tt+=te-lts[j];
                    break;
                }
                if(lts[j]>=te){
                    break;
                }
            }
            cout << tt << endl;
        }
    }
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
struct S{
	int t,n,m,s;
	S(int t,int n,int m,int s):t(t),n(n),m(m),s(s){}
};
int main(){
	int r,q,t,n,m,s,ans;
	while(cin>>r>>q,r){
		vector<S> lg; cin>>r;
		rep(i,r)cin>>t>>n>>m>>s,lg.push_back(S(t,n,m,s));
		cin>>q; rep(i,q){
			cin>>s>>t>>m; n=ans=0;
			rep(i,r-1){
				n+=lg[i].m==m&&lg[i].s==1;
				if(n>0)ans+=min(lg[i+1].t,t)-max(lg[i].t,s);
				n-=lg[i+1].m==m&&lg[i+1].s==0;
			}
			cout<<ans<<endl;
		}
	}
	return 0;
}