#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define Nmax 50005
using namespace std;
bool ok[Nmax];
vector <int>ordine;
vector<int>a[Nmax];
queue<int>coada;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void dfs(int nod)
{   if(ok[nod]==0)
{

    for(auto i : a[nod])if(ok[i]==0)dfs(i);
    ok[nod]=1;
    ordine.push_back(nod);
}

}
int main()
{
    int n,m,x,y,i,j;
    fin>>n>>m;
    for(i=1; i<=m; ++i)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
    for(i=1; i<=n; ++i)
    {
        dfs(i);
    }
    for(i=ordine.size()-1;i>=0;--i)
        fout<<ordine[i]<<' ';
    return 0;
}