#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define lowbit(x) (x&-x)
#define log(x) (31^__builtin_clz(x))
using namespace std;
const int maxn=2e5+5;
pii w[maxn],c[maxn];
map<int,int>dp1,dp2;
vector<pii>op1,op2;
void upd(){
    for(auto u:op1){
        dp1[u.first]=max(dp1[u.first],u.second);
    }
    for(auto u:op2){
        dp2[u.first]=max(dp2[u.first],u.second);
    }
    op1.clear();
    op2.clear();
}
void solve(){
    int n,m,h;
    cin>>h>>n;
    for(int i=1;i<=n;i++){
        cin>>w[i].first>>w[i].second;
        w[i+n]={w[i].first,2*h-w[i].second};
    }
    cin>>m;
    for(int i=1;i<=m;i++){
        cin>>c[i].first>>c[i].second;
        c[i+m]={c[i].first,2*h-c[i].second};
    }
    n<<=1;
    m<<=1;
    sort(w+1,w+n+1);
    sort(c+1,c+m+1);
    w[n+1].first=-1;
    c[m+1].first=-1;
    int now=m,lst=-1;
    dp1.clear();
    dp2.clear();
    op1.clear();
    op2.clear();
    for(int i=n;i>=1;i--){
        while(now&&c[now].first>=w[i].first){
            if(c[now].first!=lst)upd();
            lst=c[now].first;
            int tmp=(1ll*c[now].first-c[now].second)%(2*h);
            if(tmp<0)tmp+=2*h;
            op1.push_back({tmp,dp1[tmp]+1});
            tmp=(1ll*c[now].first+c[now].second)%(2*h);
            op2.push_back({tmp,dp2[tmp]+1});
            now--;
        }
        if(w[i].first!=lst)upd();
        lst=w[i].first;
        int z=(w[i].first-w[i].second)%(2*h),f=(1ll*w[i].first+w[i].second)%(2*h);
        if(z<0)z+=2*h;
        op1.push_back({z,dp2[f]});
        op2.push_back({f,dp1[z]});
    }
    while(now){
        if(c[now].first!=lst)upd();
        lst=c[now].first;
        int tmp=c[now].first-c[now].second;
        if(tmp<0)tmp+=2*h;
        op1.push_back({tmp,dp1[tmp]+1});
        tmp=(1ll*c[now].first+c[now].second)%(2*h);
        op2.push_back({tmp,dp2[tmp]+1});
        now--;
    }
    upd();
    cout<<dp1[0]<<"\n";
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)solve();
    return 0;
}