#include <fstream>
#include <set>

using namespace std;
const int N = 1e4 * 5 + 1;

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

bool fq[N], exist[N];
set <int> mat[N];
int n;

void dfs(int x)
{
    fq[x] = true;
    out << x << " ";
    for (auto k : mat[x])
    {
        if (!fq[k])
            dfs(k);
    }
}

int main()
{
    int n, m;
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int ns, nd;
        in >> ns >> nd;
        mat[ns].insert(nd);
        exist[ns] = exist[nd] = true;
    }
    for (int i = 1; i <= n; i++)
    {
        if (!fq[i] && exist[i])
            dfs(i);
    }
    return 0;
}