#include<vector>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int NMAX=50001;
int pred[NMAX];
vector<int>succ[NMAX];
int n,m;
int main()
{
  freopen("sortaret.in","r",stdin);
  freopen("sortaret.out","w",stdout);
  int i,x,y,aux;
  scanf("%d%d",&n,&m);
  for(i=1;i<=m;i++)
  {
    scanf("%d%d",&x,&y);
    pred[y]++;
    succ[x].push_back(y);
  }
  queue<int>q;
  vector<int>sol;
  for(i=1;i<=n;i++)
    if(pred[i]==0)
      q.push(i);
  while(!q.empty())
  {
    aux=q.front();
    sol.push_back(aux);
    for(i=0;i<succ[aux].size();i++)
    {
      pred[succ[aux][i]]--;
      if(pred[succ[aux][i]]==0)
        q.push(succ[aux][i]);
    }
    q.pop();
  }
  if(sol.size()<n)
    printf("-1\n");
  else
    for(i=0;i<sol.size();i++)
      printf("%d ",sol[i]);
  return 0;
}