#include<bits/stdc++.h>

using namespace std;
int n,m,i,x,y,v[50005];
vector <int> mu[50005];
vector <int> coada;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
void dfs(int x)
{
    v[x]=1;
    for (int i=0;i<mu[x].size();i++)
    {
        int vec=mu[x][i];
        if (v[vec]==0) {dfs(vec);}
    }
    coada.push_back(x);
}
int main()
{
    in>>n>>m;
    for (i=1;i<=m;i++)
    {
        in>>x>>y;
        mu[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        if (v[i]==0) {dfs(i);}
    for (i=coada.size()-1;i>=0;i--) out<<coada[i]<<" ";
}