#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}

random_device seed_gen;
mt19937 rng(seed_gen());
long long rand_long(long long l,long long r){
    return uniform_int_distribution<long long>(l,r-1)(rng);
}
void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int x, y, m;
    cin >> x >> y >> m;
    set<pair<int, int>> E;
    rep(i, 0, m){
        int a, b;
        cin >> a >> b;
        a--, b--;
        E.insert({a, b});
    }
    if (x <= y){
        cout << "0 " << y << "\n";
        rep(i, 0, y){
            cout << i + 1 << (i + 1 == y ? "\n" : " ");
        }
        return;
    }
    assert(x > y);
    vector<vector<int>> G(y);
    for (auto e: E) G[e.second].push_back(e.first);

    while(true) {
        vector<int> order(y);
        rep(i, 0, y) order[i] = i;
        rep(i, 0, y) swap(order[i], order[i + rand_long(0, INF) % (y - i)]);
        vector<int> p(x);
        int sum = 0;
        vector<int> ans;
        rep(i, 0, y) {
            int b = order[i];
            int n_sum = sum;
            for (auto a: G[b]) n_sum += 1 - 2 * p[a];
            int w = __builtin_clz(rand_long(0, 1ll << 60) | 1);
            if (n_sum >= sum - 1 || ((((ll)(sum - n_sum) * (ll)y < (ll)w * (ll)(i))) && ((sum - n_sum) < 60))) {
                ans.push_back(b + 1);
                for (auto a: G[b]) p[a] ^= 1;
                sum = n_sum;
            }
            //cout << sum << " " << vec_sum(p) << "\n";
        }
        if (2 * (sum + (int) ans.size()) < x + y) continue;
        cout << sum << " " << ans.size() << "\n";
        rep(i, 0, x) if (p[i]) cout << i + 1 << " ";
        cout << "\n";
        vec_out(ans);
        break;
    }
}