#include <bits/stdc++.h>
using namespace std;
vector<int> strongly_connected_components(const vector<vector<int>> &ad) {
  int n = ad.size(), time = 0;
  vector<int> scc(n), ord(n, -1);
  vector<bool> inS(n);
  stack<int> st, dst, low;
  int ver = 0;
  for (int i = 0; i < n; i++) {
    if (ord[i] != -1) continue;
    dst.push(i);
    while (dst.size()) {
      int cur = dst.top();
      if (ord[cur] == -1) {
        st.push(cur);
        inS[cur] = true;
        ord[cur] = time++;
        low.push(ord[cur]);
      } else {
        dst.pop();
        if (low.top() == ord[cur]) {
          while (true) {
            int ch = st.top();
            st.pop();
            inS[ch] = false;
            scc[ch] = ver;
            if (ch == cur) break;
          }
          ver++;
          low.pop();
        }
        continue;
      }
      for (int ch : ad[cur]) {
        if (ord[ch] == -1) {
          dst.push(ch);
        } else if (inS[ch]) {
          while (low.top() > ord[ch]) {
            low.pop();
          }
        }
      }
    }
  }
  return scc;
}
vector<vector<int>> make_compressed_graph(const vector<vector<int>> ad,
                                          const vector<int> scc) {
  int n = 0;
  for (int i = 0; i < scc.size(); i++) {
    n = max(n, scc[i] + 1);
  }
  vector<vector<int>> ta(n);
  for (int i = 0; i < ad.size(); i++) {
    for (int j = 0; j < ad[i].size(); j++) {
      int from = scc[i], to = scc[ad[i][j]];
      ta[from].push_back(to);
    }
  }
  vector<vector<int>> res(n);
  vector<bool> bucket(n);
  for (int i = 0; i < n; i++) {
    for (int ch : ta[i]) bucket[ch] = true;
    for (int ch : ta[i]) {
      if (!bucket[ch]) continue;
      if (i != ch) res[i].push_back(ch);
      bucket[ch] = false;
    }
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int q;
  cin >> q;
  while (q--) {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> ad(n);
    for (int i = 0; i < m; i++) {
      int a, b;
      cin >> a >> b;
      a--, b--;
      if (a == b) continue;
      ad[a].push_back(b);
    }
    vector<int> scc = strongly_connected_components(ad);
    vector<vector<int>> ad2 = make_compressed_graph(ad, scc);
    if (ad2.size() < 2) {
      cout << "NO\n";
      continue;
    }
    cout << "YES\n";
    int num = 0;
    while (ad2[num].size() != 0) num = ad2[num][0];
    int co = 0;
    vector<bool> ju(n);
    for (int i = 0; i < n; i++) {
      if (scc[i] == num) {
        co++;
        ju[i] = true;
      }
    }
    cout << co << " " << (n - co) << "\n";
    for (int i = 0; i < n; i++) {
      if (ju[i]) cout << (i + 1) << " ";
    }
    cout << "\n";
    for (int i = 0; i < n; i++) {
      if (!ju[i]) cout << (i + 1) << " ";
    }
    cout << "\n";
  }
  return 0;
}
