#include <bits/stdc++.h>
using namespace std;
const int N = 30050;
map<int, int> M[N];
int x[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    M[x][y] = 1;
  }
  for (int i = 1; i <= n; i++) {
    x[i] = i;
    for (int j = i; j != 1; j--) {
      if (M[x[j - 1]][x[j]] == 1)
        swap(x[j], x[j - 1]);
      else
        break;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", x[i]);
}
