#include<bits/stdc++.h>
using namespace std;

const int nmax=1e5+42;

int read_int()
{
    char c='?';

    while(isdigit(c)==0)c=getchar();

    int ret=0;

    while(isdigit(c))
    {
        ret=ret*10+c-'0';
        c=getchar();
    }

    return ret;
}

int n,m;

int nxt[nmax];

vector<int> bck[nmax],adj[nmax];

bool solved[nmax];

int parent[nmax];

bool been[nmax];

int root(int node)
{
    if(parent[node]==node)return node;

    parent[node]=root(parent[node]);

    return parent[node];
}

int solve()
{
    n=read_int();
    m=read_int();

    for(int i=0;i<=n;i++)
    {
        bck[i]={};
        adj[i]={};

        nxt[i]=-1;

        solved[i]=0;
    }

    for(int i=1;i<=m;i++)
    {
        int u=read_int();
        int v=read_int();

        bck[v].push_back(u);
        adj[u].push_back(v);
    }

    for(int i=0;i<=n;i++)
        if(solved[i]==0)
    {
        vector<int> from=bck[i];

        if(from.size()==0)return 0;

        vector<int> to=adj[from[0]];

        if(from.size()!=to.size())return 0;

        for(int j=0;j<from.size();j++)
        {
            nxt[from[j]]=to[j];

            solved[to[j]]=1;
        }
    }

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

    for(int i=0;i<=n;i++)parent[root(nxt[i])]=root(i);

    //for(int i=0;i<=n;i++)cout<<root(i)<<" ";cout<<endl;

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

    for(int i=0;i<=n;i++)
        if(solved[i]==0)
        {
            vector<int> from=bck[i];

            vector< pair<int,int> > seen={};

            for(auto w:from)
                been[root(w)]=0;

            for(auto w:from)
                if(been[root(w)]==0)
                {
                    been[root(w)]=1;

                    seen.push_back({w,nxt[w]});
                }

            for(int j=0;j<seen.size();j++)
            {
                nxt[seen[j].first]=seen[(j+1)%seen.size()].second;

                parent[root(seen[j].first)]=root(seen[(j+1)%seen.size()].second);
            }
    }

    for(int j=0;j<=n;j++)
        if(root(j)!=root(0))return 0;

    int cur=0;

    printf("YES\n");

    for(int i=0;i<=n;i++)
    {
        printf("%i ",cur);

        cur=nxt[cur];
    }

    printf("0\n");

    return 1;
}

int main()
{
    freopen("eksk.in","r",stdin);
    freopen("eksk.out","w",stdout);

    int t;
    t=read_int();

    while(t)
    {
        t--;

        if(solve()==0)printf("NO\n");
    }

    return 0;
}