#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int maxn = 50005;
vector <int> inv[maxn];
vector <int> v[maxn];
vector <int> sol;

void dfs(int nod)
{
    sol.push_back(nod);
    for(auto it : v[nod])
        dfs(it);
}

int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        in >> x >> y;
        v[x].push_back(y);
        inv[y].push_back(x);
    }
    int rad = 1;
    while(!inv[rad].empty())
        rad = inv[rad][0];
    dfs(rad);
    for(auto it : sol)
        out << it << " ";
    out << "\n";
    return 0;
}