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

using namespace std;

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

vector < int > L[100050];
int viz[100050], sol[100050];

int n, m;

void Citire()
{
    int i, x, y;
    in >> n >> m;
    for(i = 1; i <= m; i++)
    {
        in >> x >> y;
        L[x].push_back(y);
    }
    in.close();
}

void DFS(int nod)
{
    int i;
    viz[nod] = 1;
    for(i = 0; i < L[nod].size(); i++)
        if(viz[ L[nod][i] ] == 0)
            DFS(L[nod][i]);
    sol[++sol[0]] = nod;
}

void Topo()
{
    for(short i = 1; i <= n; i++)
        if(viz[i] == 0)
            DFS(i);
}

int main()
{
    Citire();
    Topo();
    for(short i = sol[0]; i >= 1; i--)
        out << sol[i] << " ";
    return 0;
}