#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

#define N_MAX 50000
#define M_MAX 100000

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

int n, m;

vector<int> sorted, inRanks, graph[N_MAX];
queue<int> q;

void read()
{
  int a, b;

  in >> n >> m;
  inRanks.assign(n, 0);
  for (int i = 0; i < m; i++)
  {
    in >> a >> b;
    graph[a - 1].push_back(b - 1);
    inRanks[b - 1]++;
  }
}

void write()
{
  for (auto a : sorted)
  {
    out << a + 1 << " ";
  }
}

int firstEmptyIn()
{
  for (int i = 0; i < n; i++)
  {
    if (inRanks[i] == 0)
      return i;
  }
  return -1;
}

void topologicalSort()
{
  q.push(firstEmptyIn());
  while (q.size())
  {
    int node = q.front();
    q.pop();
    sorted.push_back(node);
    for (auto a : graph[node])
    {
      inRanks[a]--;
      if (inRanks[a] == 0)
        q.push(a);
    }
  }
}

int main()
{
  read();
  topologicalSort();
  write();
  return 0;
}