#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <stack>
#include <random>
#include <fstream>
#include <sstream>
#include <chrono>

#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) for (auto& x: v) cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)

#define int ll

using namespace std;

#ifdef __LOCAL
	#define dbg(x) cerr << #x << " : " << x << '\n'
	const int maxn = 2e6 + 20;
#else
	#define dbg(x)
	const int maxn = 2e6 + 20;
#endif

//tg: @galebickosikasa

ostream& operator << (ostream& out, vector<int>& v) {
	for (auto& x: v) out << x << ' ';
	return out;
}

ostream& operator << (ostream& out, pii& v) {
	out << v.fi << ", " << v.se;
	return out;
}

istream& operator >> (istream& in, pii& a) {
	in >> a.fi >> a.se;
	return in;
}

const ll inf = (ll) 2e9;
const ld pi = asin (1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;
const int c = 1e6 + 5;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

vector<int> g[maxn], order;
int used[maxn], n;

void dfs (int v) {
	used[v] = 1;
	for (auto& u: g[v]) {
		if (!used[u]) dfs (u);
	}
	order.pb (v);
}

void topsort () {
	fl (i, 1, n + 1) if (!used[i]) dfs (i);
}

void solve () {
	int m;
	cin >> n >> m;
	fr (i, m) {
		int a, b;
		cin >> a >> b;
		g[a].pb (b + c);
	}
	fr (i, m) {
		g[i + c + 1].pb (i + 1);
	}
	topsort ();
	for (auto& x: used) x = 0;
	int v = order.front ();
	order.clear ();
	dfs (v);
	int cnt = 0;
	for (auto& x: used) cnt += x;
	if (cnt == n * 2) {
		cout << "No\n";
		return;
	}
	cout << "Yes\n";
	vector<int> ans1, ans2;
	fr (i, n) {
		if (used[i + 1]) ans1.pb (i + 1);
	}
	fl (i, c, n + c) {
		if (!used[i + 1]) ans2.pb (i - c);
	}
	cout << sz (ans1) << ' ' << sz (ans2) << '\n';
	cout << ans1 << '\n' << ans2 << '\n';
}





signed main () {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int q;
	cin >> q;
	while (q--) solve ();







}