#include <iostream>
#include <vector>
#include <queue>
FILE * fin =fopen("sortaret.in","r");
FILE * fout =fopen("sortaret.out","w");

std::vector<int> v[50050];
int in[50050];
int n, m;
std::queue<int> q;

int main()
{
  fscanf(fin,"%d %d",&n,&m);
  for(int i=0;i<m;i++)
  {
    int j,k;
    fscanf(fin,"%d %d",&j,&k);
    v[j].push_back(k);
    in[k]++;
  }
  for(int i=1;i<=n;i++)
    if(in[i]==0)
      q.push(i);
  while(!q.empty())
  {
    int tp = q.front();
    fprintf(fout,"%d ",tp);
    q.pop();
    for(int i=0;i<v[tp].size();i++)
    {
      int elem = v[tp][i];
      in[elem]--;
      if(in[elem]==0)
        q.push(elem);
    }
  }
}