#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
///Kahn's Algorithm for Topological Sorting
ifstream fi("sortaret.in");
ofstream fo("sortaret.out");
int m_ExtD[50005];
int SOL[50005];
vector <int>V[50005];
int indiceUni;
void KahnP(int N)
{
   for(int i=1;i<=N;i++)
   {
       int vertex=SOL[i];
        for(int i=0;i<V[vertex].size();i++)
        {
            int vecin=V[vertex][i];
            if(m_ExtD[vecin])
                m_ExtD[vecin]--;
            if(!m_ExtD[vecin])
                SOL[++indiceUni]=vecin;
        }
    }
}
int main()
{
    int N,M;
    fi>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        fi>>x>>y;
        V[x].push_back(y);
        m_ExtD[y]++;
    }
    for(int i=1;i<=N;i++)
        if(m_ExtD[i]==0)
            SOL[++indiceUni]=i;
    KahnP(N);
    for(int i=1;i<=N;i++)
        fo<<SOL[i]<<" ";
    return 0;
}