#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin ( "sortaret.in");
ofstream cout("sortaret.out");

vector <vector <int> > a;
vector <int> x, q;

void read()
{
    int n, m;
    cin >> n >> m;
    a.resize(n + 1);
    q.resize(n + 1);
    fill(q.begin(), q.end(), 0);

    for (int i = 0, x, y; i < m; i++)
    {
        cin >> x >> y;
        if (x != y && count(a[x].begin(), a[x].end(), y) == 0)
            a[x].push_back(y), q[y]++;
    }
}

void solve()
{
    for (int i = 1; i < q.size(); i++)
        if (q[i] == 0) x.push_back(i);

    for (int i = 0; i < x.size(); i++)
        for (int j = 0; j < a[ x[i] ].size(); j++)
        {
            q[ a[ x[i] ][j] ]--;
            if ( q[ a[ x[i] ][j] ] == 0 ) x.push_back( a[ x[i] ][j] );
        }
}

void write()
{
    for (int i = 0; i < x.size(); i++)
        cout << x[i] << ' ';
}

int main()
{
    read();

    solve();

    write();

    return 0;
}