#include <bits/stdc++.h>

using namespace std;

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

const int Nmax = 5e4 + 5;

int n, m;
vector <int> L[Nmax], sortTop;
bitset <Nmax> viz;

void Dfs(int nod)
{
    viz[nod] = 1;

    for(auto i : L[nod])
        if(!viz[i]) Dfs(i);

    sortTop.push_back(nod);
}

int main()
{
    fin >> n >> m;

    int x, y;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
        if(!viz[i]) Dfs(i);

    for(int i = n - 1; i >= 0; i--)
        fout << sortTop[i] << " ";

    fin.close();
    fout.close();
    return 0;
}