#include <cstdio>
#include <vector>
#define N 50001
using namespace std;
int n,t[N],k;
vector <int> G[N];
bool viz[N];
void Read()
{
int m,x,y;
freopen("sortaret.in","r",stdin);
scanf("%d%d",&n,&m);
while (m--)
   {
   scanf("%d%d",&x,&y);
   G[x].push_back(y);
   }
}
void dfs(int node)
{
viz[node]=1;
for (int i=0;i<G[node].size();++i)
    if(!viz[G[node][i]]) dfs(G[node][i]);
t[++k]=node;
}
int main()
{
freopen("sortaret.out","w",stdout);
Read();
for (int i=1;i<=n;++i)
if (!viz[i]) dfs(i);
for (int i=n;i>0;i--) printf("%d ",t[i]);
return 0;
}