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 <algorithm>
#include <cassert>
#include <iostream>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

using namespace std;

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

        unordered_map<int, int> wip;
        using Range = tuple<int, int, int>;
        vector<Range> v;
        int r;
        cin >> r;
        for (int i = 0; i < r; ++i) {
            int t;
            int n_;
            int m_;
            int s;
            cin >> t >> n_ >> m_ >> s;
            if (s == 1) {
                wip[n_] = t;
            }
            else {
                v.push_back(make_tuple(m_, wip[n_], t));
                wip.erase(n_);
            }
        }
        int q;
        cin >> q;
        for (int i = 0; i < q; ++i) {
            int t_s;
            int t_e;
            int m_;
            cin >> t_s >> t_e >> m_;
            auto merge = [](const Range& a, const Range& b) -> vector<Range> {
                int am, as, ae;
                int bm, bs, be;
                tie(am, as, ae) = a;
                tie(bm, bs, be) = b;
                int max_ = max(as, bs);
                int min_ = min(ae, be);
                if (max_ <= min_) {
                    return {make_tuple(am, min(as, bs), max(ae, be))};
                }
                return {};
            };
            vector<Range> cv;
            copy_if(begin(v), end(v), back_inserter(cv),
                    [m_](const Range& a) { return get<0>(a) == m_; });
            vector<Range> curr = cv;
            vector<Range> prev = cv;
            while (true) {
                prev = curr;
                curr = {};
                bool merged{false};
                for (int j = 0; j < static_cast<int>(prev.size()) - 1; ++j) {
                    auto a = merge(prev[j], prev[j + 1]);
                    if (a.empty()) {
                        curr.push_back(prev[j]);
                    }
                    else {
                        curr.push_back(a[0]);
                        curr.insert(end(curr), begin(prev) + j + 2, end(prev));
                        merged = true;
                        break;
                    }
                }
                if (!merged) {
                    break;
                }
            }
            cv = prev;
            cv.erase(unique(begin(cv), end(cv)), end(cv));
            int c{0};
            for (auto&& j : cv) {
                int beg = max(t_s, get<1>(j));
                int en = min(t_e, get<2>(j));
                if (en - beg > 0) {
                    c += en - beg;
                }
            }
            cout << c << endl;
        }
    }
}

C++: #include <iostream>
#include <stdio.h>
#include <ctype.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;


int main (){
  
  int pc,stu;
  
  while(1){

    cin >>pc>>stu;
    if (pc==0&&stu==0)break;
    
    int i,j,k,srec,sque,t,n,m,s,ts,te,sum;
    int record[pc][721]={};

    //record入力
    cin >>srec;
    for(i=0;i<srec;i++){
      cin >>t>>n>>m>>s;
      
      if (s==1){
	//ログイン
	for(j=t;j<721;j++){
	  record[n][j] = m;
	}
      }else{
	//ログアウト
	for(j=t+1;j<721;j++){
	  record[n][j] = 0;
	}
      }
    }
    
    //記録チェック
    sum = 0;
    cin >> sque;
    for(i=0;i<sque;i++){
      cin >> ts >>te >>m;
      for(j=ts;j<te+1;j++){
	for(k=0;k<pc;k++){
	  if (record[k][j]==m){
	    sum += 1;
	    break;
	  }
	}
      }
    }
    
    cout << sum <<endl;
  }
    
  return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

class Point{
public:
  int t,n,m,g;
  bool f;
  Point(int t = 0,int n = 0,int m = 0,int g = 0):t(t),n(n),m(m),g(g){}
  bool operator < (const Point &p)const {
    return t < p.t;
  }
};

int main(){
  int i,j,k,n,m,r,q,c;
  Point p[1000];
  while(1){
    cin >> n >> m;
    if(n == 0 && m == 0) break;

    cin >> r;
    c = 0;
    int x1,x2,x3,x4;
    for(i=0;i<r;i++){
      cin >> x1 >> x2 >> x3 >> x4;
      if(x4 == 1){
	p[c].t = x1;
	p[c].n = x2;
	p[c].m = x3;
	p[c].f = false;
	c++;
      }
      else{
	for(j=c-1;j>=0;j--){
	  if(x2 == p[j].n && x3 == p[j].m && !p[j].f){
	    p[j].f = true;
	    p[j].g = x1;
	    break;
	  }
	}
      }
    }

    sort(p,p+c);

    cin >> q;
    int y1,y2,y3,ans,totyu;
    for(i=0;i<q;i++){
      cin >> y1 >> y2 >> y3;
      ans = 0;
      totyu = y1;
      for(j=0;j<c;j++){
	if(p[j].m == y3 && p[j].g > totyu && p[j].g <= y2){
	  if(p[j].t > totyu) ans += p[j].g - p[j].t;
	  else ans += p[j].g - totyu;
	  totyu = p[j].g;
	}
	else if(p[j].m == y3 && y2 > totyu && p[j].g > y2){
	  if(p[j].t > totyu) ans += y2 - p[j].t;
	  else ans += y2 - totyu;
	  totyu = y2;
	}
      }
      cout << ans << endl;
    }


  }
  return 0;
}