Electrons and Positrons

#include<cstdio>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#define rep(i,j,k) for(register int i = j; i <= k; i++)
#define dow(i,j,k) for(register int i = j; i >= k; i--)
#define ll long long
using namespace std;

inline int read() {
    int s = 0, t = 1; char c = getchar();
    while( !isdigit(c) ) { if( c == '-' ) t = -1; c = getchar(); }
    while( isdigit(c) ) s = s * 10 + c - 48, c = getchar();
    return s * t;
}

const int N = 2e3+5, M = 4e6+5;
int dx[N], dy[N], cx[N], cy[N], f[N];
struct edge{ int to, nxt; } e[M];
int head[N], cnt = 0, ti[N], now = 0;
inline void clear() { memset(head,0,sizeof(head)), cnt = 0; }
inline void add(int x,int y) {
    e[++cnt].to = y, e[cnt].nxt = head[x], head[x] = cnt;
}
#define ez(i,j) for(register int i = head[j]; i; i=e[i].nxt)
#define to e[i].to
inline bool check(int x) {
    ez(i,x) {
        if( ti[to] != now ) {
            ti[to] = now;
            if( !f[to] || check(f[to]) ) { f[to] = x; return 1; }
        }
    }
    return 0;
 }

int main() {
     int q = read();
     while( q-- ) {
         int x = read(), y = read();
         clear();
         rep(i,1,x) dx[i] = read(), dy[i] = read();
         rep(i,1,y) cx[i] = read(), cy[i] = read();
         rep(i,1,y) {
             rep(j,1,x) if( dx[j] == cx[i] || dy[j] == cy[i] || abs(dx[j] - cx[i]) == abs(dy[j] - cy[i]) ) add(i,j);
         }
         memset(f,0,sizeof(f));
         int ans = 0;
         rep(i,1,y) {
             now++;
             if( check(i) ) ans++;
         }
         cout<<ans<<endl;
     }
    return 0;
}