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

using namespace std;

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

int n , x , y;
int m;
vector < vector < int > > a(NMAX);
queue < int > q;
int vec[50005];

int main()
{
    int i;

    f >> n >> m;

    for(i = 1 ; i <= m ; i++)
    {
        f >> x >> y;
        a[x].push_back(y);
        ++vec[y];
    }

    for(i = 1 ; i <= n ; i++)
        if(vec[i] == 0)
            q.push(i);

    int nod = 0;

    while(!q.empty())
    {
        nod = q.front();
        q.pop();
        g << nod << ' ';

        for(i = 0 ; i < a[nod].size() ; i++)
        {
            if(--vec[a[nod][i]] == 0)
                q.push(a[nod][i]);
        }
    }

    return 0;
}