#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 50000 + 5;

int n, m;

vector <int> g[N];
int st[N], cnt;

void dfs(int nod) {
  for(auto nou: g[nod]) {
    dfs(nou);
  }
  st[++cnt] = nod;
}

int main() {
  freopen("sortaret.in", "r", stdin);
  freopen("sortaret.out", "w", stdout);
  scanf("%d %d", &n, &m);
  for(int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    g[x].push_back(y);
  }
  dfs(1);
  reverse(st + 1, st + n + 1);
  for(int i = 1; i <= n; i++) {
    printf("%d ", st[i]);
  }
  printf("\n");
  return 0;
}