#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,viz[50001],sol[50001],k;
vector <int> v[50001];
void dfs(int nod)
{
    //cout<<nod<<endl;
    int i;
    viz[nod]=1;
    for(i=0;i<v[nod].size();i++)
    {
        if(!viz[v[nod][i]])dfs(v[nod][i]);
    }
    sol[++k]=nod;
}
int main()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
    {
        if(!viz[i])dfs(i);
    }
    while(k)
    {
        fout<<sol[k]<<" ";
        k--;
    }
}