//SORTARE TOPOLOGICA
#include <cstdio>
#include <vector>

using namespace std;
int nr,i,n,m,c[50009],x,y;
vector<int> G[50009];
bool sel[50009];

void dfs(int x)
{
  int i;

   sel[x]=true;


  for(i=0;i<G[x].size();++i)
  if(!sel[G[x][i]])
  dfs(G[x][i]);

  c[++nr]=x;


}



int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
      //  G[y].push_back(x);


    }

    for(i=1;i<=n;++i)
    sel[i]=false;

    nr=0;
    for(i=1;i<=n;++i)
    if(!sel[i])
    dfs(i);

    for(i=nr;i>1;--i)
    printf("%d ",c[i]);

    printf("%d\n",c[1]);

    return 0;
}