#include<bits/stdc++.h>
using namespace std;
const int MAXSIZE = 1e3 + 10;
struct node {
int x;
int y;
} a[30][MAXSIZE];
int main() {
int n, k, t, x1, y1, x2, y2;
int cunt = 0, sum1 = 0, sum2 = 0;
scanf("%d%d%d%d%d%d%d", &n, &k, &t, &x1, &y1, &x2, &y2);
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) {
scanf("%d%d", &a[i][j].x, &a[i][j].y);
}
}
//计算经过人数
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) {
if (a[i][j].x <= x2 && a[i][j].x >= x1 && a[i][j].y >= y1 && a[i][j].y <= y2) {
sum1++;
break;
}
}
}
//计算逗留人数
for (int i = 0; i < n; i++) {
cunt = 0;
int flag = 0;
for (int j = 0; j < t; j++) {
if (a[i][j].x <= x2 && a[i][j].x >= x1 && a[i][j].y >= y1 && a[i][j].y <= y2 && (cunt == 0 || flag == 1)) {
cunt++;
flag = 1;
if (cunt >= k) {
sum2++;
break;
}
} else {
cunt = 0;
flag = 0;
}
}
}
printf("%d\n%d",sum1,sum2);
return 0;
}
10-16
4813
11-21
358
09-21
876
04-04
427