#include <bits/stdc++.h>

using namespace std;

#define MA 50001

int N, M, viz[MA], deg[MA];
int ar[MA][MA];
void DFS(int x)
{
int  i = 1;
    viz[x] = 1;
    for (i = 1;i<=N;i++)
    {
        if (ar[x][i] != 0 && viz[i] == 0) DFS(i);
    }
    printf("%d ",x);

}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int i,j,k,a,b;
    scanf("%d %d",&N,&M);
    for (i=1;i<=M;i++)
    {
        scanf("%d %d",&a,&b), ar[a][b] = 1;
    }
    DFS(1);

    return 0;
}