#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

const int nMax = 50005;

int n, m;
vector<int> vecini[nMax];
bool viz[nMax];
bool hasFather[nMax];
vector<int> rasp;

void citire()
{
    ifstream in("sortaret.in");
    in >> n >> m;
    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        vecini[x].push_back(y);
        hasFather[y] = true;
    }
}

void Dfs(int current)
{
    viz[current] = true;
    for(auto v:vecini[current])
        if(viz[v] == false)
            Dfs(v);
    rasp.push_back(current);
}

void rezolvare()
{
    for(int i = 1; i <= n; ++i)
        if(hasFather[i] == false && viz[i] == false)
            Dfs(i);
}

void afisare()
{
    ofstream out("sortaret.out");
    for(int i = n - 1; i >= 0; --i)
        out << rasp[i] << " ";
    out.close();
}

int main()
{
    citire();
    rezolvare();
    afisare();
    return 0;
}