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<cstring>
using namespace std;
int main()
{
  int n,m;
  for(;cin>>n>>m,n;)
    {
      int data[n+1][1261];
      memset(data,-1,sizeof(data));
      int r;
      cin>>r;
      for(int i=0;i<r;i++)
	{
	  int t,nn,m,s;
	  cin>>t>>nn>>m>>s;
	  int num;
	  if(s==1)
	    num=m;
	  else
	    {
	      //     t++;
	      num=-1;
	    }
	  for(int i=t;i<1261;i++)
	      data[nn][i]=num;
	}
      int q;
      cin>>q;
      for(int i=0;i<q;i++)
	{
	  int ts,te,mm;
	  cin>>ts>>te>>mm;
	  int cnt=0;
	  for(int tt=ts;tt<te;tt++)
	    {
	      bool flag=false;
	      for(int i=1;i<=n&&!flag;i++)
		{
		  //  cout<<"i tt data,"<<i<<" "<<tt<<" "<<data[i][tt]<<endl;
		  if(data[i][tt]==mm)
		    flag=true;
		}
	      if(flag)
		{
		  //   cout<<"in "<<tt<<endl;
		  cnt++;
		}

	    }
	  cout<<cnt<<endl;
	}
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <tuple>

int main()
{
	while(true){
		int N, M;

		std::cin >> N >> M;
		if ( N == 0 && M == 0 ) break;

		int r;
		std::cin >> r;

		std::vector<std::tuple<int, int, int>> data(r);
		for ( int i = 0; i < r; ++i ) {
			auto &v = data[i];

			int n;
			std::cin >> std::get<0>(data[i]);
			std::cin >> n;
			std::cin >> std::get<1>(data[i]);
			std::cin >> std::get<2>(data[i]);
		}

		std::sort(data.begin(), data.end());
		int q;
		std::cin >> q;
		for ( int i = 0; i < q; ++i ) {
			int s, e, m;
			std::cin >> s >> e >> m;

			int be = s;
			int sum = 0;
			int pc = 0;
			for ( int j = 0; j < r; ++j ) {
				if ( std::get<1>(data[j]) == m ) {
					if ( std::get<2>(data[j]) == 1 ) {
						pc++;
					}else {
						pc--;
					}

					if ( be < std::get<0>(data[j]) && std::get<2>(data[j]) == 1 ) {
						if ( pc == 1 )
							be = std::get<0>(data[j]);
					}
					if ( std::get<2>(data[j]) == 0 ) {
						if ( pc == 0 ) {
							if ( e > std::get<0>(data[j]) ) {
								sum += std::get<0>(data[j]) - be;
							} else {
								sum += e - be;
								break;
							}
						}
					}
				}
			}
			std::cout << sum << std::endl;
		}
	}
	
	return 0;
}

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


int students[10001][790] = {};
int numlogin[10001] = {};
int sum[10001][790]={};
int main(){

  while(1){
    int N,M,r;
    cin >> N >> M;
    if(!N and !M) break;

    cin >> r;
    // 4byte * 10^7

    memset(students,0,sizeof(students));
    memset(numlogin,0,sizeof(numlogin));
    memset(sum,0,sizeof(sum));

    // ?¨????
    for(int i=0; i<r; i++){ // 1000
      int t,n,m,s;
      cin >> t >> n >> m >> s;
      t -= 560;
      if(s == 0) { // ?????°??¢??????
	numlogin[m]--;
	if(numlogin[m] == 0){
	  for(int i=t-1; students[m][i] != 1 and t>=0; i--){ // 1000
	    students[m][i] = 1;
	  }
	}
      }
      else{ // ?????°??????
	numlogin[m]++;
	if(numlogin[m] == 1)
	  students[m][t] = 1;
      }
    }

    // ?´???????

    for(int i=1; i<=M; i++){ // 100000
      for(int j=1; j<790; j++){ // 1000
	sum[i][j] = sum[i][j-1] + students[i][j]; 
	//	students[i][j] += students[i][j-1];
      }
    }

    // ??????
    int  q;
    cin >> q;
    for(int i=0; i<q; i++){
      int ts,te,id;
      cin >> ts >> te >> id;
      ts -= 560;
      te -= 560;
      cout << sum[id][te-1] - sum[id][ts] + students[id][ts] << endl;
      //      cout << students[id][te] - students[id][ts] << endl;
      //cout << students[id][te] - students[id][ts] << endl;
    }
  }
}

C++: #include <iostream>

using namespace std;

int st[10000][1261] = {0};
int main() {
	int N, M;
	while ( cin >> N >> M, N || M ) {
		fill(&st[0][0], &st[0][0]+10000*1261, 0);
		int r; cin >> r;
		for (int i = 0; i < r; ++i) {
			int t, n, m, s; cin >> t >> n >> m >> s; --n, --m;
			if (s == 0) { // logout
				st[m][t]--;
			}
			else {
				st[m][t]++;
			}
		}
		for (int i = 0; i < M; ++i) {
			for (int j = 1; j <= 1260; ++j) {
				st[i][j] += st[i][j-1];
			}
		}
		for (int i = 0; i < M; ++i) {
			for (int j = 0; j <= 1260; ++j) {
				st[i][j] = st[i][j] ? 1 : 0;
			}
		}
		for (int i = 0; i < M; ++i) {
			for (int j = 1; j <= 1260; ++j) {
				st[i][j] += st[i][j-1];
			}
		}
		int q; cin >> q;
		for (int t = 0; t < q; ++t) {
			int s, e, m; cin >> s >> e >> m; --m;
			cout << st[m][e-1]-st[m][s-1] << endl;
		}
	}
}

C++: #include <iostream>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < n ; i++)

int data[2000];
int main(){
	int n,m,r,p;
	while(cin >> n >> m && (n||m) ){
		cin >> r;
		int comp[1000] = {0};
		vector<int> a[10000];
		vector<int> b[10000];
		rep(i,r){
			int t , id , name , q;
			cin >> t >> id >> name >> q;
			id--,name--;
			if(q){
				comp[id] = t;
			}else{
				a[name].push_back(comp[id]);
				b[name].push_back(t);
			}
		}
		cin >> p;
		rep(i,p){
			int s , t , name;
			cin >> s >> t >> name;
			name--;
			rep(j,2000) data[j] = 0;
			int cnt = 0;
			rep(j,a[name].size()){
				for(int k = max(s,a[name][j]) ; k < min(t,b[name][j]) ; k++){
					if(!data[k]){cnt++ , data[k] = true;}
				}
			}
			cout << cnt << endl;
		}
		

	}
}