#include <cstdio>
#include<queue>
#include<vector>
using namespace std;
int pred[50005],sol[50005],nr;
vector<int> s[50005];
queue<int> q;
void bfs()
{
  int a,b,i;
  while(!q.empty())
    {
      a=q.front();
      for(i=0; i<s[a].size(); i++)
        {
		pred[s[a][i]]--;
		if(pred[s[a][i]]==0)
          q.push(s[a][i]);
        }
		sol[++nr]=a;
		q.pop();
    }
}
int main()
{
  freopen("sortaret.in","r",stdin);
  freopen("sortaret.out","w",stdout);
  int n,m,i,a,b,max=0;
  scanf("%d%d",&n,&m);
  for(i=1; i<=m; i++)
    {
      scanf("%d%d",&a,&b);
      pred[b]++;
      s[a].push_back(b);
    }
  nr=0;
  for(i=1; i<=n; i++)
    if(pred[i]==0)
      q.push(i);
  bfs();
  for(i=1;i<=nr;i++)
    printf("%d ",sol[i]);
  return 0;
}