#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=5e5;

int n,m,s,fa[Maxn+5],X[Maxn+5],Y[Maxn+5],deg[Maxn+5];
int h[Maxn+5];
inline int Find(int x) {return fa[x]==x?x:fa[x]=Find(fa[x]);}
vector<int> v[Maxn+5];

inline void Clear()
{
    For(i,1,s) vector<int>().swap(v[i]),deg[i]=0;
}
inline void Solve()
{
    cin>>n>>m; s=n*2;
    For(i,1,s) fa[i]=i;
    For(i,1,m)
    {
        int a,b; cin>>a>>b; X[i]=a,Y[i]=b;
        int x=Find(a+n),y=Find(b);
        if(x!=y) fa[x]=y;
    }
    For(i,1,n) if(Find(i)==Find(i+n)) {cout<<"No"<<endl; Clear(); return;}
    For(i,1,n)
    {
        int a=Find(i),b=Find(i+n);
        v[b].push_back(a),deg[a]++;
    }
    queue<int> q;
    For(i,1,s) h[i]=0;
    For(i,1,s) if(!deg[i]) q.push(i),h[i]=1;
    while(!q.empty())
    {
        int x=q.front(); q.pop();
        for(auto y:v[x])
        {
            h[y]=max(h[y],h[x]+1);
            if(--deg[y]==0) q.push(y);
        }
    }
    For(i,1,s) if(deg[i]) {cout<<"No"<<endl; Clear(); return;}
    cout<<"Yes"<<endl;
    For(i,1,n)
    {
        int a=Find(i),b=Find(i+n);
        cout<<h[a]-h[b]<<' ';
    } cout<<endl; Clear();
}

int main()
{
    // freopen("1.in","r",stdin);

    ios::sync_with_stdio(false);
    int T; cin>>T;
    while(T--) Solve();
    return 0;
}