#include <bits/stdc++.h>
using namespace std;

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

const int NMAX=1e5;

int n,m;
int viz[NMAX + 5];
vector<int> gr[NMAX + 5];

int f,l;
int ans[NMAX + 5];

void dfs(int arg)
{
    viz[arg]--;

    for(auto it: gr[arg])
        if(viz[it] == 1)
        {
            ans[++l]=it;
            dfs(it);
        }
}

int main()
{
    in>>n>>m;

    int r;
    while(m--)
    {
        int x,y;
        in>>x>>y;
        gr[x].push_back(y);
        viz[y]++;
        if(!viz[x]) r=x;
    }

    f=l=1;
    ans[l]=r;

    while(f<=l) dfs(ans[f++]);

    for(int i=1; i<=n; i++)
        out<<ans[i]<<' ';

    return 0;
}