#include<iostream>
#include<fstream>
#include<vector>
#include<stack>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<vector<int> > graph;
vector<bool> visited;
stack<int> sortare_t;
int n,m;


void DFS(int vertex)
{
  if(vertex<0||vertex>n-1)
  {
    return;
  }
  vector<int> s;
  int element;
  unsigned int i;
  bool found;
  s.push_back(vertex);
  visited[vertex]=true;
  while(!s.empty())
  {
    element=s.back();
    found=false;
    for(i=0; i<graph[element].size()&&!found; i++)
    {
      if(!visited[graph[element][i]])
      {
        found=true;
      }
    }
    if(found)
    {
      i--;
      s.push_back(graph[element][i]);
      visited[graph[element][i]]=true;
    }
    else
    {
     sortare_t.push(s[s.size()-1]);
      s.pop_back();
    }
  }
}

int main()
{
  f>>n>>m;
  graph.resize(n);
  visited.resize(n,0);
  int n1,n2,i;
  for(i=0; i<m; i++)
  {
    f>>n1>>n2;
    n1--;
    n2--;
    graph[n1].push_back(n2);
  }

for(unsigned int i=0;i<visited.size();i++)
    if(!visited[i])
    DFS(i);
for(int j=sortare_t.size()-1;j>=0;j--)
{g<<sortare_t.top()+1<<" ";
sortare_t.pop();
}

  return 0;
}