// G[i] lista vecinilor lui i
#include<cstdio>
#include <vector>
#define Nmax 50001
using namespace std;
bool viz[Nmax];
vector <int> G[Nmax];
int n, m, nr, sol[Nmax];
void DFS(int x)
{   viz[x]=true;
    vector <int> :: iterator it = G[x].begin(), sf = G[x].end();
    for(; it != sf; ++it)
        if(!viz[*it]) DFS(*it);
    sol[++nr]=x;
}
int main()
{   freopen("sortaret.in","r",stdin);  freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int x, y, i=1; i<=m; ++i)
        scanf("%d%d",&x,&y), G[x].push_back(y);
    for(int i=1; i<=n; ++i)
        if(!viz[i]) DFS(i);
    for(; nr ; --nr)
        printf("%d ",sol[nr]);
    printf("\n"); return 0;
}