//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int Max=50005;
int n,m,gin[Max];
vector < int >v[Max],nodd;
queue < int >q;
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 sortt()
{
    for(int i=1;i<=n;i++)
       if(gin[i]==0)
       {
           q.push(i); nodd.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)
               {
                   nodd.push_back(vecin);
                   q.push(vecin);
               }
           }
       }
}
int main()
{
    citire();
    sortt();
    for(int i=0;i<nodd.size();i++)
        out<<nodd[i]<<" ";
    return 0;
}