#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

int n, m;
vector <int> graph[50005];

void DFS(int node)
{
    fout << node << ' ';
    for (int currNode : graph[node])
    {
        DFS(currNode);
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int a, b;
        fin >> a >> b;

        graph[a].push_back(b);
    }

    DFS(1);
    fout << '\n';
}