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

using namespace std;

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

#define limn 50010
int n,m;
vector <int> G[limn];
int dr(0), gsort[limn], viz[limn];

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

int main()
{
    int x,y;
    fin>>n>>m;
    while(m--)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }

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

    for(int i=dr; i>=1; i--)
        fout<<gsort[i]<<' ';

    fin.close();
    fout.close();
    return 0;
}