#include <bits/stdc++.h>

using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
int n,m,i,j,x,y;
bool viz[50002];
vector <int> G[50002];
vector <int> sol;
void df (int nod)
{
  vector <int> :: iterator it;
  viz[nod] = true;
  for (it = G[nod].begin(); it != G[nod].end(); it++)
  {
    if (!viz[*it])
    {
      df(*it);
    }
  }
  sol.push_back(nod);
}
int main()
{
    fin >> n >> m;
    for (i = 1; i <= n; i++)
    {
      fin >> x >> y;
      G[x].push_back(y);
    }
    for (i = 1; i <= n; i++)
    {
      if (!viz[i])
      {
        df(i);
      }
    }
    reverse(sol.begin(),sol.end());
    vector <int> :: iterator it;
    for (it = sol.begin(); it != sol.end(); it++)
    {
      fout << *it << " ";
    }
    return 0;
}