#include <fstream>
#include <vector>

using namespace std;

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

vector<int>v[50001];
int  n, m, k, x, y;
int viz[50001];
vector<int>sol;

void dfs(int t)
{
    viz[t] = 1;

    for (vector<int>::iterator it = v[t].begin(); it != v[t].end(); ++it)
    {
        if (viz[*it] == 0)
        {
            dfs(*it);
        }
    }
    sol.push_back(t);
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        f >> x >> y;
        v[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
    {
        if (viz[i] == 0)
            dfs(i);
    }
    reverse(sol.begin(), sol.end());
    for (int i = 0; i < n; i++)
        g << sol[i] << " ";

    return 0;
}