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