#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 
#define togglebit(n, i) ((n) ^ (1LL << (i))) 
#define lastone(n) ((n) & (-(n))) 
char gap = 32;
#define int long long
#define ll long long 
#define lll __int128_t
#define pb push_back
// #define double long double
#define pii pair<int,int>
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;
typedef pair<double, double> pdd;
const double EPS = 1e-12;


void solve() {
    int m, n; cin >> m >> n;

    vector<vector<set<pii>>> s(2001, vector<set<pii>>(2001)); 
    vector<pair<pii, pii>> g, d; 
    for(int i = 1; i <= m; i++) {
        
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        s[x1][y1].insert({x2, y2});
    }  
    for(int i = 1; i <= n; i++) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        g.pb({{x1, y1}, {x2, y2}});
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        pair<int, int> tl = g[i].first;
        pair<int, int> br = g[i].second;
        int area = (br.first - tl.first) * (br.second - tl.second);
        int flag = 0;
        for(int j = max(0LL, tl.first - 4); j <= min(2000LL, br.first + 4); j++) {
            for(int k = max(0LL, tl.second - 4); k <= min(2000LL, br.second + 4); k++) {
                for(auto ending: s[j][k]) {
                    int p = ending.first;
                    int q = ending.second;
                    int x1 = max(j, tl.first);
                    int y1 = max(k, tl.second);
                    int x2 = min(p, br.first);  
                    int y2 = min(q, br.second);
                    int area2 = (p - j) * (q - k);
                    int area1 = (y2 - y1) * (x2 - x1);
                    if(2 * area1 >= area2) {
                        flag = 1;
                        break;
                    }
                }
            }
        }
        ans += flag;
        // if(flag == 1) {
        //     cout << i << "\n";
        // }
    }
    cout << ans << "\n";
}
signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tc;
    cin>>tc;
    while(tc--)
    solve();
    
    return 0;
}