#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
class dsu
{
    int n;
    vector<int> pa, size;

public:
    dsu(int x) : n(x), pa(x + 1), size(x + 1, 1)
    {
        iota(all(pa), 0);
    }
    int find(int x)
    {
        return pa[x] == x ? x : pa[x] = find(pa[x]);
    }
    void unite(int x, int y)
    {
        x = find(x), y = find(y);
        if (x == y)
        {
            return;
        }
        if (size[x] < size[y])
        {
            swap(x, y);
        }
        pa[y] = x;
        size[x] += size[y];
    }
};
int solve()
{
    int n, m;
    cin >> n >> m;
    dsu t(n);
    vector<vector<int>> a(n + 1);
    vector<vector<int>> g(n + 1);
    vector<vector<int>> G(n + 1);
    vector<int> in(n + 1);
    for (int i = 0; i < m; i++)
    {
        int x, y;
        cin >> x >> y;
        a[y].emplace_back(x);
    }
    for (int i = 1; i <= n; i++)
    {
        if (a[i].size() >= 2)
        {
            int x = a[i][0];
            for (auto it : a[i])
            {
                t.unite(x, it);
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (auto it : a[i])
        {
            g[t.find(it)].emplace_back(t.find(i));
            in[t.find(i)]++;
        }
    }
    queue<int> q;
    vector<int> dp(n + 1);
    for (int i = 1; i <= n; i++)
    {
        if (in[i] == 0)
        {
            q.emplace(i);
            dp[i] = 1;
        }
    }
    vector<int> ans(n + 1);
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        for (auto it : g[x])
        {
            dp[it] = max(dp[it], dp[x] + 1);
            in[it]--;
            if (in[it] == 0)
            {
                q.emplace(it);
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        dp[i] = dp[t.find(i)];
    }
    bool flag = 0;
    for (int i = 1; i <= n; i++)
    {
        for (auto it : a[i])
        {
            ans[i] = dp[i] - dp[it];
        }
        if (in[i] != 0)
        {
            flag = 1;
        }
    }
    if (flag)
    {
        cout << "No\n";
    }
    else
    {
        cout << "Yes\n";
        ans[1] = 1;
        for (int i = 1; i <= n; i++)
        {
            cout << ans[i] << " \n"[i == n];
        }
    }
    return 0;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int test;
    cin >> test;
    while (test--)
    {
        solve();
    }
    return 0;
}