#include <algorithm>
#include <fstream>
#include <vector>

using namespace std;

struct Node
{
  bool visited = false;
  vector<int> edges;
};

using Graph = vector<Node>;

void Dfs(Graph &g, int node, vector<int> &order)
{
  g[node].visited = true;
  for (const auto &next : g[node].edges) {
    if (!g[next].visited) {
      Dfs(g, next, order);
    }
  }
  order.push_back(node);
}

vector<int> TopologicalSort(Graph &g)
{
  vector<int> order;
  for (size_t i = 0; i < g.size(); ++i) {
    if (!g[i].visited) {
      Dfs(g, i, order);
    }
  }

  reverse(order.begin(), order.end());
  return order;
}

int main()
{
  ifstream fin("sortaret.in");
  ofstream fout("sortaret.out");

  int nodes, edges;
  fin >> nodes >> edges;

  Graph graph(nodes);
  for (int i = 0; i < edges; ++i) {
    int x, y;
    fin >> x >> y;
    graph[x - 1].edges.push_back(y - 1);
  }

  auto order = TopologicalSort(graph);
  for (const auto &node : order) {
    fout << node + 1 << " ";
  }
  fout << "\n";

  return 0;
}