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

using i64 = long long;

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

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

		adj[u].emplace_back(v);
		adj1[v].emplace_back(u);

		indeg[v]++;
	}

	vector<i64> fa(2 * n + 1), mx(2 * n + 1), tmx(n + 1);
	for(int i = 1; i <= 2 * n; ++i) fa[i] = i;

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

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

	for(int v: adj[1]){
		q[++r] = v;
		if(indeg[v] > 1){
			cout << "No\n";
			return;
		}
		int t = find(find, 1);
		fa[t] = v + n;
	}

	while(l <= r){
		int u = q[l++];
		int v = find(find, u + n);
		for(int i: adj1[u]){
			if(ans[i] == 0)
				ans[i] = mx[v] + 1 - tmx[i];
		}

		tmx[u] = mx[v] + 1;
		mx[u] = mx[v] + 1;

		for(int i: adj[u]){
			cnt[i]++;
			int t = find(find, i + n), v = find(find, u);
			if(t != v){
				fa[v] = t;
				mx[t] = max(mx[t], mx[v]);
			}
			if(indeg[i] == cnt[i]) q[++r] = i;
		}
	}

	for(int i = 1; i <= n; ++i) cnt[i] = 0;

	vector<i64> sum(n + 1);
	sum[1] = 1;

	l = 0, r = -1;
	q[++r] = 1;

	ans[n] = 1;

	while(l <= r){
		int u = q[l++];
		for(int v: adj[u]){
			if(sum[v] != 0 && sum[v] != sum[u] + ans[v]){
				cout << "No\n";
				return;
			}
			sum[v] = sum[u] + ans[v];
			cnt[v]++;
			if(cnt[v] == indeg[v]) q[++r] = v;
		}
	}

	// for(int i = 1; i <= n; ++i) cout << sum[i] << " ";
	// 	cout << "\n";

	for(int i = 1; i <= n; ++i){
		if(ans[i] > 1e9 || ans[i] <= 0){
			cout << "No\n";
			return;
		}
	}

	cout << "Yes\n";
	for(int i = 1; i <= n; ++i){
		cout << ans[i] << " ";
	}
	cout << "\n";

	return;
}

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

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

	return 0;
}