#include <iostream>
#include <fstream>

using namespace std;

struct drum
{
    int x,y;
};

int main()
{
    int n,m;
    int parcurs[50000];  /* Pe care drumuri poti merge*/
    drum a[100000];
    int s[50000];  /* Lista cu noduri care are GI=0  */
    int l[50000]; /*Rezultatul  */
    int val[50000];  /* GI al fiecarui nod */

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

fin >> n >> m;

  for (int i=1; i<=n; i++)
     val[i] = 0;

 for (int i=1; i<=m ;i++)
 {
   fin >> a[i].x >> a[i].y;
       val[a[i].y] += 1;
       parcurs[i] = 1;
 }

 // Noduri cu GI = 0

 int poz=1;
 for (int i=1; i<=n; i++)
      if (val[i] == 0)   {s[poz] = i; poz++; }

int first = 1,last = poz;
    while (first<last)
    {
       l[first] = s[first];
       first++;
         for (int i=1; i<=m;i++)
         {
            if ((a[i].x == s[first-1]) && (parcurs[i]))
                     {      parcurs[i]=0; val[a[i].y]--;
                            if (val[a[i].y] == 0) {s[last] = a[i].y; last++; }
                    }
         }


    }

    for (int i=1; i<first;i++)
        fout <<l[i]<<" ";

    return 0;
}