#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int N=50002;
int nrp[N],n,m,xs;
queue <int> q;
vector <int> a[N];

void citire()
{
     int x,y;
     in>>n>>m;
     for(int i=1;i<=m;i++)
     {
         in>>x>>y;
         a[x].push_back(y);
         nrp[y]++;
     }
}

void bfs()
{
    //memset(d,-1,sizeof(d));
    for(int i=1;i<=n;i++)
    {
        if(nrp[i]==0)
        {
           q.push(i);
        }
    }
    while(!q.empty())
    {
       int x=q.front();
       q.pop();
       out<<x<<' ';
       for(auto y:a[x])
       {
           nrp[y]--;
           if(nrp[y]==0)
           {
              q.push(y);
           }
       }
    }
}

int main()
{
    citire();
    bfs();
    return 0;
}