#include <iostream>
#include <fstream>

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

const int dim = 100005;
const int n_max = 50005;

int vf[dim],urm[dim],lst[dim],nr,n,m,predecesor[n_max],coada[n_max],st,dr = -1;


void Adauga(int x,int y)
{
    vf[++nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

int main()
{
    in >> n >> m;
    for (int i=1,x,y; i<=m; i++)
    {
         in >> x >> y;
         Adauga(x,y);
         predecesor[y]++;
    }

    for (int i=1; i<=n; i++)
    {
        if (predecesor[i] == 0) coada[++dr] = i;
    }
    while (st <= dr)
    {
       int x = coada[st++];
       for (int p=lst[x] ;p!=0; p = urm[p])
       {
           int y = vf[p];
           predecesor[y]--;
           if (predecesor[y] == 0)
           {
               coada[++dr] = y;
           }
       }
    }
    for (int i=0; i<=dr;i++)
    {
       out << coada[i] << " ";
    }
    return 0;
}