#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 50505;
int n, m;
vector<int> G[NMAX], sol;
bool mark[NMAX];

void read() {
  scanf("%d%d", &n, &m);
  int x, y;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &x, &y);
    G[y].push_back(x);
  }
}

void dfs(int node) {
  mark[node] = true;
  for (auto it = G[node].begin(); it != G[node].end(); it++) {
    if (!mark[*it])
      dfs(*it);
  }
  sol.push_back(node);
}

void solve() {
  for (int i = 1; i <= n; i++)
    if (!mark[i]) {
      dfs(i);
    }
  for (size_t i = 0; i < sol.size(); i++) {
    if (i > 0) printf(" ");
    printf("%d", sol[i]);
  }
  printf("\n");
}

int main() {
  freopen("sortaret.in", "r", stdin);
  freopen("sortaret.out", "w", stdout);
  
  read();
  solve();
  return 0;
}