#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m, k=0, matrix[100][100], used[100], sol[100];

void read() {
  fin >> n >> m;
  int i,j;
  for (int x = 1; x <= m; x++) {
    fin >> i >> j;
    matrix[i][j] = 1;
  }
}

void dfs(int node) {
  used[node] = 1;
  for (int i = 1; i <= n; i++)
    if (matrix[node][i] == 1 && !used[i]) {
      dfs(i);
      sol[++k] = i;
    }
}

int main() {
  read();
  dfs(1);
  for (int i = 1; i <= k; i++)
    fout << sol[i] << " ";
  return 0;
}