#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector <int> Muchii[50001], rez;
bool vizitat[50001];

void DFS(int nod)
{
    int vecin;
    vizitat[nod] = 1;
    for (int i = 0; i < Muchii[nod].size(); ++i)
    {
        vecin = Muchii[nod][i];
        if (!vizitat[vecin])
            DFS(vecin);
    }
    rez.push_back(nod);
}

void citire()
{
    int x, y;
    in >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        Muchii[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
    {
        if (!vizitat[i])
        {
            vizitat[i] = 1;
            DFS(i);
        }
    }
}

int main()
{
    citire();
    for (int i = rez.size() - 1; i >= 0; --i)
        out << rez[i] << " ";
    return 0;
}