#include <iostream>
#include <fstream>

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

int n,m;

long long a[15001][15001];
int viz[5000];
int v[5000];

void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        in>>x>>y;
        a[x][y]=1;
    }
}

int nr=0;
int counter;
void DF(int nod)
{
    nr++;
    //cout << nod << endl;
    v[++counter]=nod;
    for(int i=1;i<=n;i++)
    {
        if(a[nod][i]==1 && viz[i]==0)
        {
            viz[i]=1;
            DF(i);
        }
        //v[nr]=nod;
    }
}

int main()
{
    citire();
    DF(1);
    for(int i=1;i<=counter;i++)
    {
        out<<v[i]<<" ";
    }
    return 0;
}