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

struct Node{
  int data;
  struct Node *next;
};

int n, m, k =0;
struct Node *List[50001];
int used[50001], v[50001];

void read_graph() {
  fin >> n >> m;;
  int i, j;
  for (int x = 1; x <= m; x++) {
    fin >> i >> j;
    struct Node *c = new Node;
    c -> data = j;
    c -> next = List[i];
    List[i] = c;
  }
}

void dfs(int node) {
  used[node] = 1;
  struct Node *c = List[node];
  while (c) {
    if (!used[c->data]) {
      dfs(c->data);
    }
    c = c -> next;
  }
  v[++k] = node;
}

int main() {
  read_graph();
  dfs(1);
  fout << '\n';
  for (int i = k; i >= 1; i--)
    fout << v[i] << " ";
  return 0;
}