#include <iostream>
#include <fstream>
#include <vector>
#define M 500010
#define N 100010

using namespace std;

vector< pair<int, int> > edges[N];
int n, m, sizes[N], cicle[M], k=0;

void euler(int node)
{
    for (int i=0; i<sizes[node]; i++)
    {
        if (edges[node][i].second==1)
        {
            edges[node][i].second=0;
            euler(edges[node][i].first);
            edges[node][i].second=1;
        }
    }
    cicle[++k]=node;
}

int main()
{
    ifstream fin("ciclueuler.in");
    ofstream fout("ciclueler.out");
    int x, y;
    fin >> n >> m;
    for (int i=1; i<=m; i++)
    {
        fin >> x >> y;
        edges[x].push_back(make_pair(y, 1));
    }
    for (int i=1; i<=n; i++)
        sizes[i]=edges[i].size();
    euler(1);
    for (int i=1; i<=k; i++)
        fout << cicle[i] << " ";
    return 0;
}