/* Problem URL: https://cses.fi/problemset/task/1197 */

#include <bits/stdc++.h>

using namespace std;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    V<tuple<int, int, ll>> edges;
    while (m--) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;

        edges.emplace_back(a, b, c);
    }

    vl dis(n, 0);
    vi parent(n, -1);

    rep(i, n - 1) {
        for (auto [a, b, c] : edges) {
            if (dis[b] > dis[a] + c) {
                dis[b] = dis[a] + c;
                parent[b] = a;
            }
        }
    }

    int now = -1;
    for (auto [a, b, c] : edges) {
        if (dis[b] > dis[a] + c) {
            parent[b] = a;
            now = b;
            break;
        }
    }

    if (now == -1) {
        cout << "NO\n";
        return 0;
    }

    rep(i, n) {
        now = parent[now];
    }

    vi path = {now + 1};

    int tmp = parent[now];
    while (tmp != now) {
        path.push_back(tmp + 1);
        tmp = parent[tmp];
    }

    path.push_back(now + 1);
    reverse(all(path));
    cout << "YES\n" << path;
}