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

using namespace std;

vector <int> graf[50000 + 5];
vector <int> viz;
stack <int> lista;

void dfs(int nod)
{
    viz[nod] = 1;
    int l = graf[nod].size();
    for(int j = 0; j < l; ++j)
    {
        if(viz[ graf[nod][j] ] == 0)
            dfs(graf[nod][j]);
    }
    lista.push(nod);
}

int main()
{
    //citire date
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");

    if(!f)
    {
        cout << "eroare";
        return -1;
    }

    int n, m;
    f >> n >> m;


    for(int i = 0; i < m; ++i)
    {
        int x, y;
        f >> x >> y;
        graf[x].push_back(y);
    }

    viz.resize(n+1);
    for(int i = 1; i <= n; ++i)
        viz[i] = 0;

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

    for(int i = 0; i < n; ++i)
    {
        int x = lista.top();
        lista.pop();
        g << x << ' ';
    }
    f.close();
    g.close();
}