#include <bits/stdc++.h>

using namespace std;

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

vector <int> a[50001];
int n, m, x, y, v[50001];
deque <int> sol;

void dfs(int nod)
{
    v[nod] = 1;
    for (auto x : a[nod])
    {
        if (!v[x]) dfs(x);
    }
    sol.push_front(nod);
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        a[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
    {
        if (!v[i]) dfs(i);
    }
    for (const auto x : sol) fout << x << ' ';
    return 0;
}