#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int x,y,v[50001],i,k,u[50001],n,m,ok[50001];
vector <int> L[50001];

void dfs(int nod){
    v[nod]=1;
    for(int i=0;i<L[nod].size();i++)
        if(v[L[nod][i]]==0)
            dfs(L[nod][i]);
    u[++k]=nod;

}

int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++){
        f>>x>>y;
        L[x].push_back(y);
        ok[y]=1;
    }
    for(i=1;i<=n;i++)
        if(v[i]==0 && ok[i]==0){
            dfs(i);
        }
    for(i=k;i>=1;i--)
        g<<u[i]<<" ";

    return 0;
}