#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
#define MAX 50008
int n,m,k,t[MAX],viz[MAX],x,y;
vector <int> v[MAX];
void dfs(int nod)
{
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(!viz[v[nod][i]])dfs(v[nod][i]);
    t[k]=nod;
    --k;
}
int main()
{
    in>>n>>m;
    while(m--)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
     k=n;
    for(int i=1;i<=n;i++)
        if(!viz[i])
          dfs(i);
    for(int i=1;i<=n;i++)
        out<<t[i]<<" ";
    return 0;
}