#include <bits/stdc++.h>

using namespace std;

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

int n, m, viz[50007];
vector <int> L[50007];
int st[50007], top;

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 nod)
{
    viz[nod] = 1;
    for (auto i : L[nod])
        if (!viz[i])
            DFS(i);
    st[++top] = nod;
}

void Rezolvare()
{
    int i;
    for (i = 1; i <= n; i++)
        if (!viz[i])
            DFS(i);
    for (i = 1; i <= n; i++)
        fout << st[i] << " ";
    fout << "\n";
}

int main()
{
    Citire();
    Rezolvare();
    fin.close();
    fout.close();
    return 0;
}