#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 50000;
int n, m, ans[nmax + 5], k;
vector <int> Muchii[nmax + 5];
bool viz[nmax + 5];

void DFS(int nod)
{
    viz[nod] = true;
    for (int i = 0; i < Muchii[nod].size(); ++i)
    {
        int vecin = Muchii[nod][i];
        if (viz[vecin] == false)
            DFS(vecin);
    }
    ans[k--] = nod;
}

int main()
{
    fin >> n >> m;
    k = n;
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        Muchii[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
    {
        if (viz[i] == false)
            DFS(i);
    }
    for (int i = 1; i <= n; ++i) fout << ans[i] << " ";
    fin.close();
    fout.close();
    return 0;
}