#include <bits/stdc++.h>

using namespace std;

vector <int> L[50005];
bitset <50005> viz;
int n, m;
int cnt, t[50005];

void Read()
{
    ifstream fin("sortaret.in");
    fin >> n >> m;
    int x, y;
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
    }
}

void DFS(int k)
{
    viz[k] = true;
    for(auto i : L[k])
        if(!viz[k])
            DFS(i);
    t[++cnt] = k;
}

void SortTop()
{
    for(int i = 1; i <= n; i++)
        if(!viz[i])
            DFS(i);
}

void Afisare()
{
    ofstream fout("sortaret.out");
    int i;
    for(i = n; i >= 1; i--)
        fout << t[i] << " ";
    fout << "\n";
    fout.close();
}

int main()
{
    Read();
    SortTop();
    Afisare();
    return 0;
}