// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int par[maxn],n,m;

int findpar(int u){
    if(u!=par[u]) return par[u]=findpar(par[u]);
    return u;
}
void unions(int u,int v){
    u=findpar(u);v=findpar(v);
    if(u==v) return;
    par[v]=u;
}
vector<int> edge[maxn],adj[maxn];
vector<int> order;
int num[maxn],res[maxn];

void dfs(int u){
    num[u]=1;
    for(int v:adj[u]) if(!num[v]) dfs(v);
    order.push_back(u);
}

void solve(){
    cin >> n >> m;
    order.clear();
    for(int i=1;i<=n;i++){
        par[i]=i;num[i]=0;
        edge[i].clear();
        adj[i].clear();
    }
    for(int i=1;i<=m;i++){
        int u,v;cin >> u >> v;
        edge[v].push_back(u);
    }
    for(int i=1;i<=n;i++){
        int pre=-1;
        for(int v:edge[i]){
            if(pre!=-1) unions(pre,v);
            pre=v;
        }
    }
    for(int i=1;i<=n;i++){
        for(int v:edge[i]){
            if(findpar(i)==findpar(v)){
                cout << "No\n";
                return;
            }
            else adj[findpar(v)].push_back(findpar(i));
        }
    }
    dfs(findpar(1));
    reverse(order.begin(),order.end());
    for(int i=0;i<(int)order.size();i++) num[order[i]]=i+1;
    bool check=true;
    for(int i=1;i<=n;i++){
        res[i]=num[findpar(i)];
        if(!edge[i].empty()) res[i]-=num[findpar(edge[i][0])];
        if(res[i]<=0) check=false;
    }
    if(!check){
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for(int i=1;i<=n;i++) cout << res[i] << ' ';
    cout << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;cin >> test;
    while(test--) solve();
}