#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
#define N_MAX 50005
int n, m, viz[N_MAX];
vector <int> G[N_MAX], vs;

void sortare(int nod)
{
    viz[nod] = 1;
    for(auto it:G[nod])
    {
        if(!viz[it])
            sortare(it);
    }
    vs.push_back(nod);
}
int main()
{
    f >> n >> m;
    int x, y;
    for(int i = 1; i <= m; i++)
    {
        f >> x >> y;
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
        if(!viz[i])
            sortare(i);
    for(int i = vs.size() - 1; i >= 0; i--)
        g << vs[i] << " ";
    return 0;
}