#include<stdio.h>
#include<vector>
using namespace std;
vector <int> v[50009];
int viz[50009],n,m,x[50009];
void dfs(int p)
{
    int l,i;
    if(viz[p]==1)
        return ;
    viz[p]=1;
    l=v[p].size();
    for(i=0;i<l;i++)
        dfs(v[p][i]);
    printf("%d ",p);
}
int main ()
{
    int v1,v2,i;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&v1,&v2);
        v[v2].push_back(v1);
        x[v1]++;
    }
    for(i=1;i<=n;i++)
        if(x[i]==0)
            dfs(i);
    printf("\n");
    return 0;
}