#include <cstdio>
#include <vector>
using namespace std;
vector<int>G[50005];
int sol[50005];
bool viz[50005];
int k;
void dfs(int nod){
  viz[nod] = 1;
  for (int i = 0; i < G[nod].size(); ++i){
    int v = G[nod][i];
    if (!viz[v])
      dfs(v);
  }
  sol[++k] = nod;
}
int main(){
  freopen("sortaret.in", "r", stdin);
  freopen("sortaret.out", "w", stdout);
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; ++i){
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
  }
  for (int i = 1; i <= n; ++i)
    if (!viz[i])
      dfs(i);
  for (int i = n; i >= 1; --i)
    printf("%d ", sol[i]);
  printf("\n");
  return 0;
}