Negative Cycles :(

#include <iostream>
#include <cstdio>
#include <stack>
#include <bitset>
#include <algorithm>
#include <vector>
#define task ""

using namespace std;
using ll = long long;
using ld = long double;

const int N = 2e3 + 500 + 2;
int n, m, u[N * 2], v[N * 2], par[N];
const ll Inf = 1e18;
ll w[N * 2], d[N];
vector<int> nadj[N];
int ans = 0;
bool vis[N];

void Read()
{
    cin >> n >> m;
    for (int i = 1; i <= m; ++i)
        cin >> u[i] >> v[i] >> w[i];
}

bool Bellman()
{
    for (int i = 1; i < n; ++i)
    {
        for (int j = 1; j <= m; ++j)
            if (d[v[j]] > d[u[j]] + w[j])
            {
                d[v[j]] = d[u[j]] + w[j];
                par[v[j]] = u[j];
            }
    }
    for (int j = 1; j <= m; ++j)
        if (d[v[j]] > d[u[j]] + w[j])
            return true;
    return false;
}

bool dfs(int v)
{
    vis[v] = 1;
    for (auto i : nadj[v])
        if (!vis[i])
        {
            if (dfs(i))
                return true;
        }
        else
        {
            ans = i;
            return true;
        }
    return false;
}

void Solve()
{
    if (!Bellman())
    {
        cout << "NO";
        return;
    }
    cout << "YES\n";
    for (int i = 1; i <= n; ++i)
        nadj[par[i]].push_back(i);
    for (int i = 1; i <= n; ++i)
        if (!vis[i])
            if (dfs(i))
            {
                int v = ans;
                stack<int> ok;
                ok.push(v);
                do
                {
                    ok.push(v = par[v]);
                } while (v != ans);
                while (ok.size())
                {
                    cout << ok.top() << " ";
                    ok.pop();
                }
                return;
            }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen(task ".INP", "r"))
    {
        freopen(task ".INP", "r", stdin);
        freopen(task ".OUT", "w", stdout);
    }
    Read();
    Solve();
}