#include <bits/stdc++.h>
#define NMAX 50005

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int v[NMAX];

vector <int> l[NMAX];

void dfs(int nod)
{
    v[nod]++;

    if(v[nod] == 1)
        g << nod << " ";

    for(int i = 0; i < l[nod].size(); i++)
        if(v[l[nod][i]] == 0)
        {
            //cout << l[nod][i] << '\n';
            dfs(l[nod][i]);
        }
}

int main()
{
    int n, m;

    bool gr[n + 1];

    f >> n >> m;

    for(int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;

        l[x].push_back(y);

        gr[y] = 1;
    }

    for(int i = 1; i < n; i++)
    {
        if(gr[i] == 0)
        {
            dfs(i);
            return 0;
        }
    }

    return 0;
}