#include<bits/stdc++.h>

using namespace std;

vector<int> L[50002];
int n, viz[50002], st[50002], k;

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

void DFS(int nod)
{
     viz[nod] = 1;
     for (auto i : L[nod])
         if (viz[i] == 0) DFS(i);
     st[++k] = nod;
}

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

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

int main()
{
    Citire();
    SortareTopologica();
    Afisare();
    return 0;
}