#include <iostream>
#include <fstream>
#include <vector>



using namespace std;
#define MAX_N 50015
vector <int> Muchii[MAX_N];
vector <int> Sortat;
int conexe = 0;
int M,N;
bool viz[MAX_N];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

void DFS(int Nod)
{
    viz[Nod] = true;
    for(unsigned int i = 0 ; i< Muchii[Nod].size(); i++)
    {
        int vecin = Muchii[Nod][i];
        if(!viz[vecin])
            DFS(vecin);
    }
    Sortat.push_back(Nod);
}


void citire()
{
    fin>>N>>M;
    for(int i = 1 ; i <= M; i++)
    {
        int coefx,coefy;
        fin>>coefx>>coefy;
        Muchii[coefx].push_back(coefy);
    }
    for(int i=1;i<=N;i++)
    {
        if(!viz[i])
            DFS(i);
    }
    for(int i = Sortat.size() - 1; i >= 0; i--)
        fout << Sortat[i] << ' ';
}

int main()
{
    citire();

    return 0;
}