с

#include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <memory.h>
#include <algorithm>
#include <stack>
#include <deque>
#include <iomanip>
#include <stdio.h>
#include <queue>
#include <chrono>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#include <cstdlib>
#define int long long
#define pii pair <int, int>
#define pb push_back
#define all(vc) vc.begin(), vc.end()
#define fir first
#define sec second
#define endl "\n"
#define un unsigned
#define sp system("pause")
#define INF 1000000009
#define double long double
using namespace std;

const int N = 500009, R = 1 << 20, nlog = 19, ABC = 26, MOD = 1e9 + 7;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

vector<pii> euler;
vector<int> used;

void cycle(vector<vector<int>> &gr, int v, int p)
{
    used[v] = 1;

    for (auto u : gr[v])
    {
        if (!used[u])
        {
            cycle(gr, u, v);
        }
        else if (used[u] == 1)
        {
            cout << "No";
            exit(0);
        }
    }

    used[v] = 2;
    return;
}

vector<int> dist;

vector<int> top_sort;

void ts(vector<vector<int>> &gr, int v)
{
    used[v] = 1;

    for (auto u : gr[v])
    {
        if (!used[u])
        {
            ts(gr, u);
        }
    }

    top_sort.push_back(v);
}

int cur = 1;

vector<int> ans;

void dfs(vector<vector<int>> &gr, int v, int p)
{
    used[v] = 1;
    euler[v].first = cur;
    cur++;

    for (auto u : gr[v])
    {
        if (!used[u] && dist[u] == dist[v] + 1)
        {
            ans[u] = v;
            dfs(gr, u, p);
        }
        else if (used[u])
        {
            if (euler[v].first > euler[u].first)
            {
                cout << "No";
                exit(0);
            }
        }
    }

    euler[v].second = cur;
    cur++;
    return;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

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

    euler.assign(n + 1, { 0, 0 });
    ans.assign(n + 1, -1);

    vector<vector<int>> gr(n + 1);

    vector<int> st(n + 1, 0);

    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;

        gr[a].pb(b);
        st[b]++;
    }

    for (int i = 1; i <= n; i++)
    {
        sort(all(gr[i]));
        gr[i].erase(unique(all(gr[i])), gr[i].end());
    }

    int cnt = 0, start = 0;

    for (int i = 1; i <= n; i++)
    {
        if (st[i] == 0)
        {
            cnt++;
            start = i;
        }
    }

    if (cnt != 1)
    {
        cout << "No";
        exit(0);
    }

    used.assign(n + 1, 0);

    cycle(gr, start, -1);

    for (int i = 1; i <= n; i++)
    {
        if (!used[i])
        {
            cout << "No";
            exit(0);
        }
    }

    used.assign(n + 1, 0);

    ts(gr, start);

    reverse(all(top_sort));

    dist.assign(n + 1, 0);

    dist[start] = 1;

    for (auto i : top_sort)
    {
        for (auto u : gr[i])
        {
            dist[u] = max(dist[u], dist[i] + 1);
        }
    }

    used.assign(n + 1, 0);

    dfs(gr, start, -1);

    cout << "Yes" << endl;

    for (int i = 1; i <= n; i++)
    {
        cout << ans[i] << " ";
    }

    //sp;
    return 0;
}