#include <bits/stdc++.h>
#define N 50005
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> G[N];
int n,m;
bool viz[N];
stack <int> S;

void Read()
{  int i,x,y;
   fin>>n>>m;
   for(i=1;i<=m;++i)
     { fin>>x>>y;
       G[x].push_back(y);
     }
   fin.close();
}

void DFS(int x)
{  viz[x]=1;
   for(int i=0;i<G[x].size();++i)
       if(!viz[G[x][i]]) DFS(G[x][i]);
   S.push(x);
}

void Sortare_Topologica()
{  int i;
   for(i=1;i<=n;++i)
     if(!viz[i]) DFS(i);
}

void Afisare()
{ while(!S.empty())
      { fout<<S.top()<<" ";
        S.pop();
      }
}

int main()
{   Read();
    Sortare_Topologica();
    Afisare();
    fout.close();
    return 0;
}