#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
const int N = 1e4;
int n, k, t, xl, yd, xr, yu;

struct Node {
    int a, b;
} node[N];
vector<Node> constant_node;
int cres;

int main() {
    cin >> n >> k >> t >> xl >> yd >> xr >> yu;
    int temp, jingguo = 0, douliu = 0;
    for (int i = 1; i <= n; i++) {
        temp = 0;
        cres = 0;
        int size = 0;
        for (int i = 1; i <= t; i ++) {
            cin >> node[i].a >> node[i].b;
            if (node[i].a >= xl && node[i].a <= xr && node[i].b >= yd && node[i].b <= yu) {
                temp++;
                constant_node.push_back(node[i]);
            } else {
                size = constant_node.size();
                cres = max(size, cres);
                constant_node.clear();
                continue;
            }
            size = constant_node.size();
            cres = max(size, cres);

        }
        constant_node.clear();

        if (cres >= k) {
            douliu++;
        }
        if (temp) {
            jingguo++;
        }
    }
    cout << jingguo << endl << douliu << endl;


}
···