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

using namespace std;

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

#define lim 50010
int n,m,sol[lim],dr;
bool viz[lim];
vector <int> G[lim];

void dfs (int nod)
{
    viz[nod]=1;
    sol[++dr]=nod;
    for (auto it:G[nod])
        if (!viz[it])
            dfs(it);
}

int main()
{
    int x,y;
    fin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }

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

    for (int i=1; i<=n; i++)
        fout<<sol[i]<<' ';

    return 0;
}