#include <bits/stdc++.h>

using namespace std;

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

int n, m, cnt;
int t[50005];
vector <int>L[50005];
int viz[50005];
void Citire()
{
    int i, x, y;

    fin >> n >> m;

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

void DFS(int k)
{
    int i;
    viz[k] = 1;

    for(auto i : L[k])
        if(viz[i] == 0)
            DFS(i);
    t[++cnt] = k;
}

void SortareTop()
{
    int i;
    for(i = 1; i <= n; i++)
        if(viz[i] == 0)
            DFS(i);

}

void Afisare()
{
    int i;

    for(i = n; i >= 1; i--)
        fout << t[i] << " ";
    fout << "\n";
}
int main()
{
    Citire();
    SortareTop();
    Afisare();
    return 0;
}