#include <cstdio>
#include <vector>
using namespace std;

vector <int> a[50005];
int coada[50005],prim,ultim,n,m,x,y,g[50005];

void lee(int k)
{
    printf("%d ",k);
    if(prim==ultim)
        return;
    int nr=a[k].size();
    for(int i=0;i<nr;i++)
    {
        g[a[k][i]]--;
        if(g[a[k][i]]==0)
        {
            coada[ultim]=a[k][i];
            ultim++;
        }
    }
}



int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        a[x].push_back(y);
        g[y]++;
    }
    ultim=1;
    for(int i=1;i<=n;i++)
    {
        if(g[i]==0)
        {
            coada[ultim]=i;
            ultim++;
        }
    }
    prim=1;
    lee(prim);
    return 0;
}