复杂的n*t
#include <iostream>
using namespace std;
int sum[2];
int main() {
int n,k,t,xl,yd,xr,yu;
cin >> n >> k >> t >>xl >>yd >>xr >> yu;
for (int i = 0; i < n; i++) {
bool flag = false;
int seq_day = 0;
int max_seq_day = 0;
for (int j = 0; j < t; j++) {
int x, y;
cin >>x >>y;
if((x <= xr && x >= xl)&&(y <= yu && y >= yd)){
flag = true;
seq_day ++;
max_seq_day = max(max_seq_day,seq_day);
} else{
seq_day = 0;
}
}
if(flag){
sum[0] ++;
if(max_seq_day >= k){
sum[1]++;
}
}
}
cout <<sum[0]<<endl;
cout <<sum[1]<<endl;
return 0;
}