#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> A[100001];
int v[100001], poz = 1;

void dfs(int nod) {
    for (int i = 0; i < A[nod].size(); ++i) {
        int vecin = A[nod][i];
        v[++poz] = vecin;
        dfs(vecin);
    }
}

int main() {
    int n, m, x, y;
    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        fin >> x >> y;
        A[x].push_back(y);
    }
    dfs(1);
    v[1] = 1;
    for (int i = 1; i <= poz; ++i)
        fout << v[i] << " ";

}