#include<cstdio>
#include<cassert>

#include<vector>
#include<algorithm>
#include<queue>

using namespace std;

vector<int> graph[50005];
int n, m, deg[50005];

void read(){
  assert(freopen("sortaret.in", "r", stdin));

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

  for(int i = 0; i < m; ++i){
    int x, y;
    scanf("%d%d", &x, &y);
    ++deg[y];
    graph[x].push_back(y);
  }

}

vector<int> ans;

void solve(){
  queue<int> q;
  for(int i = 1; i <= n; ++i)
    if(deg[i] == 0)
      q.push(i);

  while(!q.empty()){
    int now = q.front();
    q.pop();
    ans.push_back(now);
    for(int i = 0; i < graph[now].size(); ++i){
      --deg[graph[now][i]];
      if(deg[graph[now][i]] == 0)
        q.push(graph[now][i]);
    }
  }
}

void write(){
  assert(freopen("sortaret.out", "w", stdout));

  if(ans.size() < n)
    printf("-1");
  else
    for(int i = 0; i < ans.size(); ++i)
      printf("%d ", ans[i]);
}

int main(){
  read();
  solve();
  write();

  return 0;
}