#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n, m, x, y, fr[50005];
vector<int> v[50005];
vector<int> order;
queue <int> q;

void top_sort () {
    int counter = 1;
    while (!q.empty()) {
        int k = q.front();
        q.pop();
        order.push_back(k);
        fr[k] = 1;

        for (auto x: v[k])
            if (fr[x] == 0) {
                q.push (x);
                fr[x] = 1;
            }
    }
}

int main()
{
    f >> n >> m;
    for (int i=1; i<=m; ++i) {
        f >> x >> y;
        v[x].push_back (y);
        fr[y] ++;
    }
    for (int i=1; i<=n; ++i)
        if (fr[i] == 0)
            q.push(i);
    for (int i=1; i<=n; ++i)
        fr[i] = 0;

    top_sort ();
    for (auto x: order)
        g << x << ' ';
    return 0;
}