#include<iostream>
using namespace std;
#include<vector>

void solve() {
	int n, m;
	cin >> n >> m;

	vector<vector<int>> adj(n + 1), adj1(n + 1);
	for (int i = 0; i < m; ++i) {
		int u, v;
		cin >> u >> v;

		adj[v].emplace_back(u);
	}

	vector<int> fa(n + 1);
	for (int i = 1; i <= n; ++i) fa[i] = i;

	auto find = [&](auto find, int x) ->int {
		if (fa[x] != x) fa[x] = find(find, fa[x]);
		return fa[x];
		};

	for (int i = 1; i <= n; ++i) {
		for (int j : adj[i]) {
			int a = find(find, adj[i][0]), b = find(find, j);
			if(a != b) fa[a] = b;
		}
	}

	int cnt = 0;
	vector<int> indeg(n + 1);
	for (int i = 1; i <= n; ++i) {
		for (int j : adj[i]) {
			int a = find(find, i), b = find(find, j);
			adj1[b].emplace_back(a);
			indeg[a]++;
		}
	}

	vector<int> q(n + 1);
	int l = 0, r = -1;

	for (int i = 1; i <= n; ++i) {
		if (find(find, i) == i) {
			++cnt;
			if (indeg[i] == 0) q[++r] = i;
		}
	}

	vector<int> dp(n + 1);

	while (l <= r) {
		int u = q[l++];
		--cnt;

		for (int v : adj1[u]) {
			dp[v] = max(dp[v], dp[u] + 1);
			--indeg[v];

			if (indeg[v] == 0) q[++r] = v;
		}
	}

	if (cnt != 0) {
		cout << "No\n";
	}
	else {
		cout << "Yes\n";
		cout << "1 ";
		for (int i = 2; i <= n; ++i) {
			cout << dp[find(find, i)] - dp[find(find, adj[i][0])] << " ";
		}
		cout << "\n";
	}

	return;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t = 1;
	cin >> t;
	while (t--) solve();

	return 0;
}