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++: #define _USE_MATH_DEFINES
#define INF 100000000

#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>

using namespace std;

typedef long long ll;
typedef pair <int,int> P;


static const double EPS = 1e-8;

int tx[] = {-1,0,1,0};
int ty[] = {0,1,0,-1};

class Data{
public:
	int time;
	bool login;
	Data() : time(0),login(false){}
	Data(int t,int l){
		this->time = t;
		this->login = l;
	}
};

int main()
{
	int N,M;//N:pc M:student
	while(~scanf("%d %d",&N,&M)){
		if(N==M && M==0) break;
		map<P,vector<Data> > log;
		int r;
		scanf("%d",&r);
		for(int i=0;i<r;i++){
			//s:1 login s:0 logout
			//Pc n
			//student m
			//time t
			int t,n,m,s;
			scanf("%d %d %d %d",&t,&n,&m,&s);
			log[P(n,m)].push_back(Data(t,s));
		}
		int q;
		scanf("%d",&q);

		for(int i=0;i<q;i++){
			int ts,te,m;
			//student m
			scanf("%d %d %d",&ts,&te,&m);

			bool stay[1270];
			memset(stay,0,sizeof(stay));

			for(int j=1;j<=N;j++){
				if(log.find(P(j,m)) == log.end()) continue;
				for(int k=0;k<log[P(j,m)].size();k+=2){
					int s = max(log[P(j,m)][k].time,ts);
					int e = min(log[P(j,m)][k+1].time,te);
					if(e-s<=0) continue;
					for(int l=s;l<=e;l++) stay[l] = true;
				}
			}

			int res = 0;
			for(int j=0;j<1270;j++){
				if(stay[j]){
					int k=j;
					for(;k<1270;k++){
						if(!stay[k]) break;
					}
					j=k;
					res += k-j-1;
				}
			}
			printf("%d\n",res);
		}


	}
}

C++: #include<iostream>

using namespace std;

int use[10001][1261];

int main(){

	while(1){
		int N,M,r,q;
		int t,n,m,s;
		int ts,te;

		cin>>N>>M;

		if(N==0&&M==0) break;

		cin>>r;
		for(int i=0;i<=M;i++){
			for(int j=0;j<=1260;j++){
				use[i][j]=0;
			}
		}
		for(int i=0;i<r;i++){
			cin>>t>>n>>m>>s;
			if(s==0) use[m][t]--;
			if(s==1) use[m][t]++;
		}
		for(int i=0;i<=M;i++){
			for(int j=1;j<=1260;j++){
				use[i][j]+=use[i][j-1];
			}
		}
		cin>>q;
		for(int i=0;i<q;i++){
			cin>>ts>>te>>m;
			int ans=0;
			for(int j=ts;j<te;j++){
				if(use[m][j]!=0) ans++;
			}
			cout<<ans<<endl;
		}
	}
}

C++: #include <bits/stdc++.h>
#define r(i,a,n) for(int i=a;i<n;i++)
using namespace std;
int main(){
	int n,p;
	while(cin>>n>>p,n){
		int q,a[p][1261-540],ch[p][1261-540],b,c,d,e;
		r(i,0,p)r(j,0,1261-540)ch[i][j]=a[i][j]=0;
		cin>>q;
		r(i,0,q){
			cin>>b>>c>>d>>e;
			/*b-=540;
			if(e==1){a[d-1][b]++;ch[d-1][b]=c;}
			else{
				for(int j=b-1;j>=0;j--){
					if(ch[d-1][j]==c)break;
					a[d-1][j]++;
				}
			}*/
		}
		cin>>q;
		/*while(q--){
			int s=0;
			cin>>b>>c>>d;
			b-=540;
			c-=540;
			r(i,b,c)if(a[d-1][i])s++;
			cout<<s<<endl;
		}*/
	}
}

C++: #include<cstdio>
#include<stack>
#include<vector>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
typedef pair<int,int> P;
stack<P> stu[100003];
vector<P> vec[100003];
int N,M,r;
int t[1003],n[1003],m[1003],s[1003];
int q;
int qs[55],qe[55],qm[55];
int main(){
  while(1){
    memset(t,0,sizeof(t));
    memset(n,0,sizeof(n));
    memset(m,0,sizeof(m));
    memset(s,0,sizeof(s));
    memset(qs,0,sizeof(qs));
    memset(qe,0,sizeof(qe));
    memset(qm,0,sizeof(qm));
    for(int i=0;i<100003;i++)vec[i].resize(0);
    for(int i=0;i<100003;i++){
      while(1){
        if(!stu[i].empty()) stu[i].pop();
        else break;
      }}

    scanf("%d%d",&N,&M);
    if(N==0 && M==0) break;
    scanf("%d",&r);
    for(int i=0;i<r;i++){
      scanf("%d%d%d%d",&t[i],&n[i],&m[i],&s[i]);
      if(s[i]==1) stu[m[i]].push(P(t[i],n[i]));
      if(s[i]==0) {
        P p=stu[m[i]].top();
        stu[m[i]].pop();
        if(stu[m[i]].empty()) vec[m[i]].push_back(P(p.first,t[i]));
      }
    }
    scanf("%d",&q);
    int i;
    for(i=0;i<q;i++) {
      scanf("%d%d%d",&qs[i],&qe[i],&qm[i]);

      int res=0;

      int j;
      bool flg1=true;
      for(j=0;j<vec[qm[i]].size();j++){
        if(vec[qm[i]][j].first <=qs[i] && vec[qm[i]][j].second >=qs[i]){
          res+=vec[qm[i]][j].second-qs[i];
          flg1=false;
          break;
        }}
      int l;
      bool flg2=true;
      for(l=0;j<vec[qm[i]].size();l++){
        if(vec[qm[i]][l].first <=qe[i] && vec[qm[i]][l].second >=qe[i]){
          res+=qe[i]-vec[qm[i]][l].first;
          flg2=false;
          break;
        }}

      if(flg1==false && flg2==false){
        for(int ru=j+1;ru<l;ru++) res+=vec[qm[i]][ru].second-vec[qm[i]][ru].first;
      }
      if(flg1==true && flg2==false){
        for(int ru=0;ru<l;ru++)  res+=vec[qm[i]][ru].second-vec[qm[i]][ru].first;
      }
      if(flg1==true && flg2==true){
        for(int ru=0;ru<vec[qm[i]].size();ru++) res+=vec[qm[i]][ru].second-vec[qm[i]][ru].first;
      }
      if(flg1==false && flg2==true){
        for(int ru=j+1;ru<vec[qm[i]].size();ru++)  res+=vec[qm[i]][ru].second-vec[qm[i]][ru].first;
      }



      printf("%d\n",res);

    }

  }
  return 0;
}