#include <bits/stdc++.h>
using namespace std;
int m,n,i,x,y,st[50010],k;
vector<int>g[50010];
bool sel[50010];
void DFS(int x)
{
    int i;
    sel[x]=true;
    for(i=0; i<g[x].size(); ++i)
        if(!sel[g[x][i]])DFS(g[x][i]);
    st[++k]=x;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1; i<=m; ++i)
    {
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
    }
    for(i=1; i<=n; ++i)
        if(!sel[i])DFS(i);
    for(i=k; i>=1; --i)
        printf("%d ",st[i]);
    return 0;
}