///#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int nmax=50000;
int n,m,sol[nmax+5];
bool use[nmax+5];
vector<int>v[nmax+5];bool plec[nmax+5];
void dfs(int nod)
{
    use[nod]=1;
    cout<<nod<<" ";
    for(int i=0;i<v[nod].size();i++)
        if(use[v[nod][i]]==0)
            dfs(v[nod][i]);
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        plec[i]=1;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
        plec[b]=0;
    }
    for(int i=1;i<=n;i++)
        if(plec[i] and !use[i])
            dfs(i);
    return 0;
}
/**s
1<2<4<4>
**/