import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        const N0 = readInt;
        const N1 = readInt;
        int M = readInt;
        alias Edge = Tuple!(int, "u", int, "v");
        auto E = new Edge[M];
        foreach (i; 0 .. M) {
          E[i].u = readInt - 1;
          E[i].v = readInt - 1;
        }
        E = E.sort.uniq.array;
        M = cast(int)(E.length);
        
        auto maxVs = new int[N0];
        maxVs[] = -1;
        auto hparg = new int[][N1];
        foreach (i; 0 .. M) {
          const u = E[i].u;
          const v = E[i].v;
          chmax(maxVs[u], v);
          hparg[v] ~= u;
        }
        
        auto on0 = new int[N0];
        auto on1 = new int[N1];
        foreach (v; 0 .. N1) {
          int[2] cnt;
          foreach (u; hparg[v]) if (maxVs[u] == v) ++cnt[on0[u]];
          ++cnt[0];
          debug writeln(v, " ", cnt);
          if (cnt[0] > cnt[1]) {
            foreach (u; hparg[v]) on0[u] ^= 1;
            on1[v] ^= 1;
          }
        }
        
        writeln(on0.count(1), " ", on1.count(1));
        writeln(iota(N0).filter!(u => on0[u]).map!(u => u + 1).to!string.replaceAll(regex("[\\[,\\]]"), ""));
        writeln(iota(N1).filter!(v => on1[v]).map!(v => v + 1).to!string.replaceAll(regex("[\\[,\\]]"), ""));
      }
    }
  } catch (EOFException e) {
  }
}