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<vector>

using namespace std;

struct DATA{
  int info1;
  int info2;
};

vector<DATA> Convert(vector<DATA>);
int getTime(vector<DATA>, int, int);

int main(){
  int i, n, m, r, q, time, log, t1, t2, ans;
  DATA _data;

  while(1){
    cin >> n >> m;
    if(n == 0 && m == 0) break;

    vector< vector<DATA> > data1(m), data2;
    cin >> r;

    for(i=0; i<r; ++i){
      cin >> time >> n >> m >> log;
      _data.info1 = time;
      _data.info2 = log;
      data1[m-1].push_back(_data);
    }

    for(i=0; i<data1.size(); ++i)
      data2.push_back(Convert(data1[i]));

    cin >> q;

    for(i=0; i<q; ++i){
      cin >> t1 >> t2 >> m;
      cout << getTime(data2[m-1], t1, t2) << endl;
    }
  }
  return 0;
}

vector<DATA> Convert(vector<DATA> data1){
  int i, j, in_count, out_count;
  DATA _data;
  vector<DATA> data2;

  i = 0;
  j = i;
  in_count = 0;
  out_count = 0;
  while(j < data1.size()){
    if(data1[j].info2 == 1) ++in_count;
    else ++out_count;

    if(in_count == out_count){
      _data.info1 = data1[i].info1;
      _data.info2 = data1[j].info1;
      data2.push_back(_data);
      i = j + 1;
      in_count = 0;
      out_count = 0;
    }
    ++j;
  }

  return data2;
}

int getTime(vector<DATA> data, int start, int end){
  int i, ans;

  for(i=0, ans=0; i<data.size(); ++i){
    if(data[i].info1 > start && data[i].info2 > end)
      ans += (end - data[i].info1);
    else if(data[i].info1 < start && data[i].info2 < end)
      ans += (data[i].info2 - start);
    else if(data[i].info1 < start && data[i].info2 > end)
      ans += (end - start);
    else if(data[i].info1 >= start && data[i].info2 <= end)
      ans += (data[i].info2 - data[i].info1);
  }
  return ans;
}

C++: #include<bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define pb            push_back
template<class T, class S> inline pair<T, S> mp(T x, S y){ return make_pair(x, y); }
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }

static const int    INF = 1000000000;
static const ll     MOD = 1000000007LL;
static const double EPS = 1E-12;

const int MAX_M = 11111;
const int MAX_R = 1111;
const int MAX_T = 800;
int id[MAX_M][MAX_T];
int N, M;
int r, q;
struct _R{int t, m, n, s;} R[MAX_R];
int ts, te, m;

int main()
{
  while(cin >> N >> M, N){
    rep(i, M) rep(j, 777) id[i][j] = 0;
    cin >> r;
    rep(i, r) cin >> R[i].t >> R[i].n >> R[i].m >> R[i].s;
    rep(i, r) if(!R[i].s) R[i].s = -1;

    rep(i, r) id[R[i].m - 1][R[i].t - 540] = R[i].s;
    rep(i, M) rrep(j, 1, 777) id[i][j] += id[i][j - 1];

    cin >> q;
    rep(i, q){
      cin >> ts >> te >> m;
      int res = 0;
      rrep(j, ts, te) if(id[m - 1][j - 540]) res += 1;
      cout << res << endl;
    }
  }

  return 0;
}

C++: #include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>

using namespace std;

int n, m, r, q, t[10000][1300];

int main() {

	
	while (1) {

		for (int i = 0; i < 10000; i++) {
			for (int j = 0; j < 1300; j++) {
				t[i][j] = 0;
			}
		}

		cin >> n >> m;
		if (n==0 && m==0) break;

		cin >> r;
		for (int i = 0; i < r; i++) {
				int tt, tn, tm, ts;
				cin >> tt >> tn >> tm >> ts;
				if (ts == 1) t[tm-1][tt]++;
				else t[tm - 1][tt+1]--;
		}

		for (int i = 0; i < m; i++) {
			for (int j = 1; j <1300; j++) {
				t[i][j] += t[i][j-1];
			}
		}

		//vector<int> v;
		cin >> q;
		for (int i = 0; i < q; i++) {
			int ts, te, tm;
			cin >> ts >> te >> tm;
			int ans=0;
			for (int j = ts; j < te; j++) {
				if (t[tm - 1][j]>0 && t[tm - 1][j+1]>0) ans++;
			}
			cout << ans << endl;
			//v.push_back(ans);
		}
		/*
		for (int h = 0; h < v.size(); h++) {
			cout << v[h] << endl;
		}
		*/
	}

	return 0;
}