#include <cstdio>
#include <vector>
#define max_n 50010

using namespace std;

int n,m,x,y;
vector <int > G[max_n];
int d[max_n];
int Q[max_n];

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

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

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

vector <int > :: iterator it;

for(i=1;i<=n;i++)
  if(!d[i])
     //Q.push_back(i);
      Q[++Q[0]]=i;
for(i=1;i<=n;i++){
      x=Q[i];
      for(it=G[x].begin();it!=G[x].end();++it)
    {
             d[*it]--;
             if(!d[*it])
                 //Q.push_back(*it);
                 Q[++Q[0]]=*it;
            }
     }

for(i=1;i<=n;i++)
printf("%d ",Q[i] );

}