include<bits/stdc++.h>

define check exit(0)

define inp 30000

define ll long long int

using namespace std;

vector<pair<ll,ll>> g[inp];

vector weight(inp,0);

vector vis1(inp,false),vis2(inp,false);

vector par(inp);

vector ans;

void dfs(ll n,ll tot) {

vis1[n]=true; 

weight[n]=tot;

for(pair<ll,ll> c:g[n])
{
    if(vis1[c.first] && !vis2[c.first]) // cycle detected
    {
        ll tmp = weight[n]-weight[c.first] + c.second;
        if(tmp<0) //Negative total 
        {   
            ans.push_back(c.first);
            while(n!=c.first)
            {
                ans.push_back(n);
                n=par[n];
            }
            ans.push_back(c.first);

            reverse(ans.begin(),ans.end());

            cout<<"YES\n";
            for(int x:ans) cout<<x<<" ";
            check;
        }
    }
    if(!vis1[c.first]) { par[c.first]=n; dfs(c.first , tot+c.second); }
}

vis2[n]=true; //fully discovered node

}

int main() {

ll n,m;
cin>>n>>m; // no. of vertices & edges

vector<vector<ll>> arr(n+1,vector<ll>(n+1,LLONG_MAX)); // adj. matrix so that we can maintain min. weighted edge


for(ll i=1,u,v,w;i<=m;i++)
{
    cin>>u>>v>>w;
    arr[u][v]=min(arr[u][v],w);
}

for(int i=1;i<=n;i++)
{
    for(int j=1;j<=n;j++)
    {
        if(arr[i][j]<LLONG_MAX) { g[i].push_back({j,arr[i][j]}); } // preparing adj. list
    }
}

for(int i=1;i<=n;i++)
{
    if(!vis1[i])
    {
        dfs(i,0);      
    }
}

cout<<"NO\n"; // No neg. cycle found

return 0;

}