#include <bits/stdc++.h>
#define oo 0x3f3f3f3f

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, x, y;
vector<int> graf[50001];
vector<int> sorted;
bool viz[50001];

void read()
{
  f>>n>>m;
  for(int i = 1;i <= m;++i)
    f>>x>>y, graf[x].push_back(y);
}

void dfs(int node)
{
  viz[node] = true;

  for(auto it : graf[node])
    if(!viz[it])
      dfs(it);

  sorted.push_back(node);
}


void solve()
{
  memset(viz, false, sizeof(viz));

  for(int i = 1;i <= n;++i)
    if(!viz[i])
      dfs(i);

  for(vector<int>::reverse_iterator it = sorted.rbegin();it != sorted.rend();++it)
    g<<*it<<" ";
}


int main()
{
  read();
  solve();
  return 0;
}