#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;struct wall{ int x1, y1, x2, y2, ok; } W[110];int main(){ int t, n, k; scanf("%d", &t); while(t--) { scanf("%d%d", &n, &k); int mx = 0; for(int i = 0; i < n; i++) { scanf("%d%d%d%d", &W[i].x1, &W[i].y1, &W[i].x2, &W[i].y2); if(W[i].x1 > W[i].x2) swap(W[i].x1, W[i].x2); W[i].ok = 1; mx = max(mx, W[i].x2); } int sum = 0; for(int i = 0; i <= mx; i++){ int cnt = 0; for(int j = 0; j < n; j++) if(i >= W[j].x1 && i <= W[j].x2 && W[j].ok == 1) cnt++; if(cnt <= k) continue; cnt -= k; sum += cnt; while(cnt--) { int End = 0, id = 0; for(int k = 0; k < n; k++) if(W[k].ok == 1 && i >= W[k].x1 && i <= W[k].x2 && W[k].x2 > End) { id = k; End = W[k].x2; } W[id].ok = 0; } } printf("%dn", sum); } return 0;}
