#include <fstream>
#include <vector>
#include <stack>
using namespace std;

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

vector<int> adj[50001];
stack<int> mystack;
bool visited[50001];

void dfs(int nod) //dfs normal
{
    visited[nod] = true;
    for (int i : adj[nod])
        if (visited[i] == false)
            dfs(i);
    mystack.push(nod);
}
int n, m, x, y;
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        adj[x].push_back(y);
    }

    for (int i = 1; i <= n; ++i)
    {
        if (visited[i] == false) // facem dfs pt fiecare nod false, 
        //iar la cautarile urm sarim nodurile care au fost facute true
            dfs(i);
    }

    while (!mystack.empty()) // in de la stg la dreapta vor fi valorile sortate topologic(dar invers)
    // asa ca daca privim stackul de sus (top) in jos si afisam dupa facem pop => sortare topologica
    {
        fout << mystack.top() << " ";
        mystack.pop();
    }

    return 0;
}