#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
vector <int> V[50001];
int g[50001],nr;
int viz[50001];
void DFS(int x)
{
    viz[x]=1;
    vector <int> :: iterator it;
    for(it=V[x].begin();it!=V[x].end();it++)
        if(viz[*it]==0)
            DFS(*it);
    g[++nr]=x;
}
int main()
{int x,y,i,ok;
fin>>n>>m;
vector <int> :: iterator it;
for(i=1;i<=m;i++)
{
    fin>>x>>y;
    V[x].push_back(y);
}
for(i=1;i<=n;i++)
    if(viz[i]==0)
        DFS(i);
for(i=nr;i>=1;i--)
    fout<<g[i]<<" ";
    return 0;
}