#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int word;
typedef unsigned char byte;
struct READ{
	char c,w;
	inline READ(){c=getchar();}
	template<typename type>
	inline READ& operator>>(type &num){
		for(w=1;'0'>c||c>'9';c=getchar())
			w=c=='-'? -1:1;
		for(num=0;'0'<=c&&c<='9';c=getchar())
			num=num*10+(c-'0');
		return num*=w,*this;
	}
}cin;
word case_,n,m,top;
const word nsiz=2e5+10,msiz=1<<19;
std::vector<word> from[nsiz],to[nsiz],block[nsiz];
word fsiz[nsiz],dis[nsiz];
struct union_{
	word fa[nsiz],size[nsiz];
	inline void clear(){
		for(word i=1;i<=n;++i){
			fa[i]=i,size[i]=1;
			fsiz[i]=dis[i]=0;
			from[i].clear(),to[i].clear();
			block[i].clear();
		}
	}
	inline word find(word id){
		if(fa[id]==id) return id;
		return fa[id]=find(fa[id]);
	}
	inline void merge(word u,word v){
		if(u=find(u),v=find(v),u!=v){
			if(size[u]<size[v]) fa[u]=v,size[v]+=size[u];
			else fa[v]=u,size[u]+=size[v];
		}
		
	}
}_union;
inline void dfs(word id){
	dis[id]=++top;
	for(auto &p:block[id])
		for(auto &i:to[p]){
			const word nxt=_union.find(i);
			if(--fsiz[nxt]==0) dfs(nxt);
		}
}
int main(){
	for(cin>>case_;case_;--case_){
		cin>>n>>m,top=0,_union.clear();
		for(word i=1,u,v;i<=m;++i){
			cin>>u>>v;
			to[u].push_back(v);
			from[v].push_back(u);
		}
		for(word id=1;id<=n;++id)
			for(auto& i:from[id])
				_union.merge(from[id][0],i);
		for(word id=1;id<=n;++id)
			block[_union.find(id)].push_back(id);
		for(word id=1;id<=n;++id)
			if(_union.find(id)==id)
				for(auto &p:block[id])
					for(auto &i:to[p]) 
						++fsiz[_union.find(i)];
		if(_union.size[_union.find(1)]!=1||fsiz[1]){
			puts("No");
			continue;
		}
		dfs(_union.find(1));
		bool b=0;
		for(word id=1;id<=n;++id)
			if(_union.find(id)==id&&dis[id]==0) b=1;
		if(b) puts("No");
		else{
			printf("Yes\n1");
			for(word id=2;id<=n;++id)
				printf(" %u",dis[_union.find(id)]-dis[_union.find(from[id][0])]);
			putchar('\n');
		}
	}
	return 0;
}