#include <bits/stdc++.h>
using namespace std;
template <typename T>
T next_int() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') {
    p = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ch - '0');
    ch = getchar();
  }
  return p * x;
}
string next_token() {
  char ch;
  string ans = "";
  do {
    ch = getchar();
  } while (ch <= ' ');
  while (ch > ' ') {
    ans += ch;
    ch = getchar();
  }
  return ans;
}
const long long INF = (long long)1e18;
const int INFINT = (int)1e9 + 227 + 1;
const int MAXN = (int)1e6 + 227 + 1;
const int MOD = (int)1e9 + 7;
const long double EPS = 1e-9;
long long bin_pow(long long a, long long b) {
  if (!b) return 1;
  long long ans = bin_pow(a, b / 2);
  ans = ans * ans % MOD;
  if (b % 2) ans = ans * a % MOD;
  return ans;
}
map<pair<int, int>, int> a;
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int x = next_int<int>();
    int y = next_int<int>();
    a[make_pair(x, y)] = 1;
  }
  list<int> ans;
  ans.insert(ans.end(), 1);
  for (int i = 2; i <= n; i++) {
    list<int>::iterator j = ans.end();
    j--;
    while (1) {
      if (!a[make_pair(*j, i)]) {
        j++;
        ans.insert(j, i);
        break;
      }
      if (j == ans.begin()) {
        ans.insert(j, i);
        break;
      }
      j--;
    }
  }
  for (list<int>::iterator i = ans.begin(); i != ans.end(); i++)
    cout << *i << " ";
  puts("");
}
