#include <iostream>
#include <stdio.h>

#define nn 50000
using namespace std;

int n,m, viz[nn];

struct nod{
    int inf;
    nod *urm;
}*G[nn];

void add(int a, int b)
{
    nod *aux = new nod;
    aux->inf = b;
    aux->urm = G[a];
    G[a] = aux;
}

void dfs(int x)
{
    printf("%d ",x);
    viz[x] = 1;

    for(nod *p=G[x];p;p=p->urm)
        if(!viz[p->inf])
            dfs(p->inf);
}

int main()
{
    freopen ("sortaret.in","r",stdin);
    freopen ("sortaret.out","w",stdout);
    scanf("%d %d", &n, &m);

    int a,b;
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d", &a, &b);
        add(a,b);
    }

    for(int i=1;i<=n;i++)
        if(G[i])
        {
            dfs(i);
            break;
        }
        else
            printf("%d ", i);
    return 0;
}