#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cstdlib>

using namespace std;

void print(vector<int>& way) {
    cout << "YES\n";
    vector<int> ans;
    for (int i = way.size() - 2; i >= 0; --i) {
        ans.push_back(way[i] + 1);
        if (way[i] == way.back()) break;
    }
    for (int i = ans.size() - 1; i >= 0; --i) {
        cout << ans[i] << " ";
    }
    exit(0);
}
void dfs(int v, vector<int>& used, vector<set<int>>& g, vector<int>& way) {
    used[v] = 1;
    way.push_back(v);
    for (auto to : g[v]) {
        if (used[to] == 0) dfs(to, used, g, way);
        else if (used[to] == 1) {
            way.push_back(to);
            print(way);
        }
    }
    used[v] = 2;
    way.pop_back();
}
int main() {
    int n, m;
    cin >> n >> m;
    vector<set<int>> g(n);
    vector<int> used(n, false);
    vector<int> way;
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        g[a].insert(b);
    }
    for (int i = 0; i < n; ++i) {
        if (used[i] == 0) {
            way.clear();
            dfs(i, used, g, way);
        }
    }
    cout << "NO";
}