#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T MAX(T a, T b) {
  if (a > b) return a;
  return b;
}
template <class T>
inline T MIN(T a, T b) {
  if (a < b) return a;
  return b;
}
template <class T>
inline T ABS(T x) {
  if (x < 0) return -x;
  return x;
}
inline void OPEN(const string &s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}
const static int inf = 1000000000;
int n, m, x, y;
vector<vector<int> > ver(30005);
vector<int> res;
bool visited[30005] = {};
void dfs(int now) {
  if (visited[now]) return;
  visited[now] = true;
  for (int(i) = (0); (i) < (ver[now].size()); ++(i)) {
    dfs(ver[now][i]);
  }
  res.push_back(now);
}
int main() {
  scanf("%d%d", &n, &m);
  bool bisa = true;
  for (int(i) = (0); (i) < (m); ++(i)) {
    scanf("%d%d", &x, &y);
    ver[x].push_back(y);
  }
  for (int(i) = (1); (i) <= (n); ++(i)) dfs(i);
  for (int(i) = (0); (i) < (res.size()); ++(i)) {
    if (i) printf(" ");
    printf("%d", res[i]);
  }
  printf("\n");
  return 0;
}
