//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int Max=50005;
queue <int>q; int gin[Max];
int n,m;
vector <int>v[Max],sol;
void citire()
{
  in>>n>>m;
  for(int i=1;i<=m;i++)
  {
      int x,y; in>>x>>y;
      v[x].push_back(y); gin[y]++;
  }
}
void sortare()
{
    for(int i=1;i<=n;i++)
        if(gin[i]==0)
    {
        q.push(i); sol.push_back(i);
    }
    while(!q.empty())
    {
        int nod=q.front(); q.pop();

        for(int j=0;j<v[nod].size();j++)
        {
            int vecin=v[nod][j];
            gin[vecin]--;
            if(gin[vecin]==0)
            {
                q.push(vecin); sol.push_back(vecin);
            }
        }
    }
}
int main()
{
    citire();
    sortare();
    for(int j=0;j<sol.size();j++)
        out<<sol[j]<<" ";
    return 0;
}