for (int i = 0; i < m; i++) {
    ll a, b, c;
    cin >> a >> b >> c;
    edges.emplace_back(a, b, c);
}

dist[1] = 0;

for (int i = 1; i < n; i++) {
    last = -1;
    for (auto ed : edges) {
        if (dist[ed.u] != INF && dist[ed.u] + ed.w < dist[ed.v]) {
            dist[ed.v] = dist[ed.u] + ed.w;
            par[ed.v] = ed.u;
            last = ed.v;
        }
    }
}

// Kiểm tra chu trình âm
for (auto ed : edges) {
    if (dist[ed.u] != INF && dist[ed.u] + ed.w < dist[ed.v]) {
        last = ed.v;
        break;
    }
}

if (last == -1) {
    cout << "NO" << endl;
    return;
}


vector<ll> ans;
for (ll cur = last;; cur = par[cur]) {
    ans.push_back(cur);
    if (cur == last && ans.size() > 1) break;
}

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

cout << "YES" << endl;
for (auto i : ans) cout << i << " ";
cout << endl;