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 <cstdio>
#include <algorithm>
using std::pair;
using std::make_pair;
#include <vector>
using std::vector;

typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<PII> > VP;

int main(void) {
    while (1) {
        int n; // pc
        int m; // person
        scanf("%d%d", &n, &m);
        if (n == 0 && m == 0) {
            break;
        }

        VI pc(m + 1, 0);
        VI start(m + 1, 0);

        VP time(m + 1);

        int r;
        scanf("%d", &r);
        for (int i = 0; i < r; i++) {
            int t;
            int n2; // pc
            int m2; // person
            int s;
            scanf("%d%d%d%d", &t, &n2, &m2, &s);
            if (s == 1) {
                if (pc[m2] == 0) {
                    start[m2] = t;
                }
                pc[m2]++;
            } else {
                pc[m2]--;
                if (pc[m2] == 0) {
                    int end = t;
                    time[m2].push_back(make_pair(start[m2], end));
                }
            }
        }

        int q;
        scanf("%d", &q);
        for (int i = 0; i < q; i++) {
            int s;
            int e;
            int m2;
            scanf("%d%d%d", &s, &e, &m2);
            int count = 0;

            for (int j = 0; j < (int)(time[m2].size()); j++) {
                int first = time[m2][j].first;
                int second = time[m2][j].second;
                int start;
                int end;
                if (s < first) {
                    start = first;
                } else if (s <= second) {
                    start = s;
                } else {
                    continue;
                }
                if (e < first) {
                    break;
                } else if (e <= second) {
                    end = e;
                } else {
                    end = second;
                }
                count += end - start;
            }
            printf("%d\n", count);
        }

    }
    return 0;
}

C++: /*
 * A.cpp
 *
 *  Created on: 2017/05/06
 *      Author: jln
 */
#define MYDEBUG
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <cstdio>
#include <queue>
#include <stack>

#ifdef MYDEBUG
#define debug(x) cout<<#x<<": "<<x<<endl
#else
#define debug(x)
#endif
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define all(x) x.begin(), x.end()
#define umap unordered_map
using namespace std;

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
	out << "[";
	size_t last = v.size() - 1;
	for (size_t i = 0; i < v.size(); ++i) {
		out << v[i];
		if (i != last)
			out << ",";
	}
	out << "]";
	return out;
}
const int maxm = 10001;
const int maxt = 1261;
int N, M;
int r;
int q;
int tl[maxm][maxt];
void solve() {
	while (cin >> N >> M, (N || M)) {
		cin >> r;
		vector<stack<int> > stu(M + 1); //????????°????????????????????¨???
		for (int i = 0; i < maxm; ++i) {
			for (int j = 0; j < maxt; ++j) {
				tl[i][j] = 0;
			}
		}

		for (int i = 0; i < M + 1; ++i) { //init
			stu[i] = stack<int>();
		}

		for (int i = 0; i < r; ++i) { //?????°??°, input
			int t, n, m, s;
			cin >> t >> n >> m >> s;
			if (s == 0) { //pop
				if (stu[m].empty()) {
					debug("stack is empty!");
					return;
				}
				int ts = stu[m].top();
				int te = t;
				stu[m].pop();
				if (stu[m].empty()) {
					for (int time = ts; time <= te; ++time) { //?????£?????¨????????????ON
						tl[m][time] = 1;
					}
				}
			} else { //push
				stu[m].push(t);
			}
		}

		cin >> q;
		for (int j = 0; j < q; ++j) { //?????¨?????°, output
			int ts, te, m;
			cin >> ts >> te >> m;
			int ans = 0;
			//for (int t = ts; t <= te; ++t) {
			//	printf("%3d ", t);
			//}
			//cout << endl;
			int cnt = 0, past = 0;
			for (int t = ts; t <= te; ++t) {
				if (past == 1 && tl[m][t] == 0)
					cnt++;
				past = tl[m][t];
				//printf("%3d ", tl[m][t]);
				ans += tl[m][t];
			}
			//cout << endl;
			cout << ans - cnt - tl[m][te] << endl;
		}
	}
}

int main() {
	solve();
	return 0;
}