#include<bits/stdc++.h>
using namespace std;
using ll=long long;

#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = mod - (inv[mod % i] * (mod / i));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }

}

mint nCk(ll n, ll k) {
    if (n < k||k<0) return 0;
    return fact[n] * (factinv[k] * factinv[n - k]);
}

void solve(){
    ll X,Y,M;
    cin>>X>>Y>>M;
    vector<vector<ll>> G(X);
    for(int i=0;i<M;i++){
        int u,v;cin>>u>>v;
        u--;v--;
        G[u].push_back(v);
    }
    for(int x=0;x<X;x++){
        sort(G[x].begin(),G[x].end());
        vector<ll> GG;
        for(auto y:G[x]){
            if(GG.size()==0||GG.back()!=y)GG.push_back(y);
        }
        swap(G[x],GG);
    }
    while(1){
        vector<bool> U(Y,0);
        int YN=0;
        vector<int> YY,XX;
        for(int i=0;i<Y;i++){
            U[i]=rand()%2;
            if(U[i])YY.push_back(i);
        }
        int XN=0;
        for(int x=0;x<X;x++){
            int cnt=0;
            for(int y:G[x])if(U[y])cnt++;
            if(cnt%2==1){
                XX.push_back(x);
            }
        }
        if(YY.size()+XX.size()<(X+Y+1)/2)continue;
        int xn=XX.size(),yn=YY.size();
        cout<<xn<<" "<<yn<<endl;
        for(int i=0;i<xn;i++){
            cout<<XX[i]+1<<" \n"[i==xn-1];
        }
        for(int i=0;i<yn;i++){
            cout<<YY[i]+1<<" \n"[i==yn-1];
        }
        return;
    }
}

int main(){

    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll T;
    cin>>T;
    while(T--)solve();
}