#include <bits/stdc++.h>
using namespace std;
int viz[50005],x,y,n,m,i,nr,vect[50005];
vector <int> v[50005];
void dfs(int nod)
{
    int i;
    viz[nod]=1;
    nr++;
    vect[nr]=nod;
    for(i=0;i<v[nod].size();i++)
        if(viz[v[nod][i]]==0)dfs(v[nod][i]);
}
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);
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            dfs(i);
        }
    }
    for(i=1;i<=nr;i++)
    printf("%d ",vect[i]);
    return 0;
}