#include <bits/stdc++.h>
const int maxn = 2e6 + 9, mod = 998244353, inf = 0x3f3f3f3f;
int Read() {
  int x(0), f(1);
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3ll) + (x << 1ll) + c - '0';
    c = getchar();
  }
  return x * f;
}
void Chkmin(int &x, int y) {
  if (y < x) x = y;
}
void Chkmax(int &x, int y) {
  if (y > x) x = y;
}
int add(int x, int y) { return x += y, x >= mod ? x - mod : x; }
int dec(int x, int y) { return x -= y, x < 0 ? x + mod : x; }
int mul(int x, int y) { return 1ll * x * y % mod; }
int Pow(int base, int b) {
  int ret(1);
  while (b) {
    if (b & 1) ret = mul(ret, base);
    base = mul(base, base);
    b >>= 1;
  }
  return ret;
}
int n, m, T, tim, top, col;
int dfn[maxn], low[maxn], vis[maxn], sta[maxn], bel[maxn];
std::vector<int> V[maxn];
std::pair<int, int> e[maxn];
void Dfs(int u) {
  dfn[u] = low[u] = ++tim;
  sta[++top] = u;
  vis[u] = 1;
  for (int i = 0; i < V[u].size(); ++i) {
    int v(V[u][i]);
    if (!dfn[v]) {
      Dfs(v);
      Chkmin(low[u], low[v]);
    } else if (vis[v]) {
      Chkmin(low[u], dfn[v]);
    }
  }
  if (low[u] == dfn[u]) {
    int x;
    ++col;
    do {
      x = sta[top--];
      vis[x] = 0;
      bel[x] = col;
    } while (x != u);
  }
}
void Tclear() {
  col = 0;
  for (int i = 1; i <= 2 * n; ++i) {
    vis[i] = dfn[i] = low[i] = 0;
  }
  top = 0;
}
void Tarjan() {
  Tclear();
  for (int i = 1; i <= 2 * n; ++i)
    if (!dfn[i]) {
      Dfs(i);
    }
}
void Solve() {
  int mi(inf), pos1(0), pos2(0);
  for (int i = 1; i <= n; ++i)
    if (bel[i] < mi) {
      mi = bel[i];
      pos1 = i;
    }
  mi = inf;
  for (int i = 1; i <= n; ++i)
    if (bel[i + n] < mi && bel[i] ^ bel[pos1]) {
      mi = bel[i + n];
      pos2 = i + n;
    }
  assert(pos1 && pos2);
  Tclear();
  Dfs(pos1);
  Dfs(pos2);
  for (int i = 1; i <= 2 * n; ++i)
    if (!dfn[i]) {
      Dfs(i);
    }
  int num1(0);
  puts("Yes");
  for (int i = 1; i <= n; ++i) {
    num1 += (bel[i] < bel[i + n]);
  }
  printf("%d %d\n", num1, n - num1);
  for (int i = 1; i <= n; ++i)
    if (bel[i] < bel[i + n]) {
      printf("%d ", i);
    }
  puts("");
  for (int i = 1; i <= n; ++i)
    if (bel[i] > bel[i + n]) {
      printf("%d ", i);
    }
  puts("");
}
void Clear() {
  for (int i = 1; i <= 2 * n; ++i) {
    std::vector<int>().swap(V[i]);
  }
}
int main() {
  T = Read();
  while (T--) {
    n = Read();
    m = Read();
    for (int i = 1; i <= m; ++i) {
      int x(Read()), y(Read());
      if (x == y) continue;
      e[i] = std::pair<int, int>(x, y);
      V[x].push_back(y);
      V[y + n].push_back(x + n);
    }
    Tarjan();
    int flag(1);
    for (int i = 1; i <= n; ++i) {
      flag &= (bel[i] == bel[1]);
    }
    int flag2(1);
    for (int i = 1; i <= n; ++i) {
      flag2 &= (bel[i + n] == bel[1]);
    }
    if (flag || flag2) {
      puts("No");
    } else {
      Solve();
    }
    Clear();
  }
  return 0;
}
