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 <cstdio>
#include <cstdint>
#include <vector>
#include <algorithm>

int testcase_ends() {
  size_t N, M;
  scanf("%zu %zu", &N, &M);
  if (N == 0 && M == 0) return 1;

  size_t r;
  scanf("%zu", &r);
  std::vector<std::vector<int>> tt(M, std::vector<int>(1270));
  for (size_t i = 0; i < r; ++i) {
    size_t t, n, m;
    int s;
    scanf("%zu %zu %zu %d", &t, &n, &m, &s);
    --m;
    if (s == 1) {
      // log in
      ++tt[m][t];
    } else {
      --tt[m][t];
    }
  }

  for (size_t i = 0; i < M; ++i) {
    for (size_t j = 1; j < tt[i].size(); ++j)
      tt[i][j] += tt[i][j-1];
    for (size_t j = 0; j < tt[i].size(); ++j)
      tt[i][j] = !!tt[i][j];
    for (size_t j = 1; j < tt[i].size(); ++j)
      tt[i][j] += tt[i][j-1];
    // for (size_t j = 0; j < tt[i].size(); ++j)
    //   fprintf(stderr, "%d%c", tt[i][j], j+1<tt[i].size()? ' ':'\n');
  }

  size_t q;
  scanf("%zu", &q);
  for (size_t i = 0; i < q; ++i) {
    size_t s, e, m;
    scanf("%zu %zu %zu", &s, &e, &m);
    --m;
    --s;
    --e;
    printf("%d\n", tt[m][e]-tt[m][s]);
  }
  return 0;
}

int main() {
  while (!testcase_ends()) {}
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int login[10100][1261];

int main() {
	int N,M;
	while(cin>>N>>M,N){
		int r,q;
		cin>>r;
		int i;
		memset(login,0,sizeof(login));
		for(i=0;i<r;i++){
			int t,n,m,s;
			cin>>t>>n>>m>>s;
			login[m][t]+=(s?1:-1);
		}
		int j;
		int l;
		for(j=0;j<=M;j++){
			l=0;
			for(i=540;i<=1260;i++){
				l+=login[j][i];
				login[j][i]=l;
//cout<<j<<" "<<i<<" "<<l<<endl;
			}
		}
		cin>>q;
		for(i=0;i<q;i++){
			int ts,te,m;
			cin>>ts>>te>>m;
			int res=0;
			for(j=ts;j<te;j++){
				if(login[m][j]>0)res++;
			}
			cout<<res<<endl;
		}
	}
	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(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;//cout <<"m:"<<mm<<endl;
			for(int j=si[mm];j!=-1;j=ni[j]){
				//cout << lts[j] << " " << lte[j] << endl;
				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>
using namespace std;

typedef struct{
  int time;
  bool inout;
} Data;

int main(){
  int n,m;
  while(cin>>n>>m,n){
    int r,q;
    Data data;
    vector<vector<Data> > vec(m);
    cin>>r;
    for(int i=0;i<r;i++){
      int t,pc,number,check;
      cin>>t>>pc>>number>>check;
      data.time=t;
      data.inout=(bool)check;
      vec[number-1].push_back(data);
    }
    cin>>q;
    for(int i=0;i<q;i++){
      int ts,te,number;
      cin>>ts>>te>>number;
      number--;
      int time=ts;
      int check=0;
      int sum=0;
      for(int i=0;i<(int)vec[number].size();i++){
	data = vec[number][i];
	if(data.inout) check++;
	else check--;
	if(ts <= data.time && data.time <= te){
	  if(data.inout && check == 1) time=data.time;
	  if(!data.inout&& check == 0){ 
	    sum += data.time-time;
	    time=data.time;
	  }
	}
	if(!data.inout && data.time > te){
	  sum+=te-time;
	  break;
	}
	if(check == 1 && data.inout && data.time > te) break;
      }
      cout<<sum<<endl;
    }
  }
  return 0;
}