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

using namespace std;

#define NMAX 100005

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

int nrNoduri, nrMuchii;
vector <int> grafNormal[NMAX], grafTranspus[NMAX];
queue <int> coadaSortare;
bool vizitat[NMAX];
int grade[NMAX];

void sortareTopologica(){

    while ( !coadaSortare.empty() ){

        int nodCurent  = coadaSortare.front();

        for ( int vecin = 0; vecin < grafTranspus[nodCurent].size(); vecin++ ){

            grade[grafTranspus[nodCurent][vecin]]--;

            if ( grade[grafTranspus[nodCurent][vecin]] == 0 )
                    coadaSortare.push(grafTranspus[nodCurent][vecin]);


        }

        fout << nodCurent << " ";

        coadaSortare.pop();

    }

}

int main(){

    fin >> nrNoduri >> nrMuchii;

    for ( int i = 1; i <= nrNoduri; i++){
                    vizitat[i] = false;
                    grade[i] = 0;
    }

    for ( int i = 1; i <= nrMuchii; i++){
            int x,y;
            fin >> x >> y;

            grafNormal[y].push_back(x);
            grafTranspus[x].push_back(y);
            grade[y]++;
    }

    for ( int i = 1; i <= nrNoduri; i++)
        if ( grade[i] == 0 )
                coadaSortare.push(i);

    sortareTopologica();

    return 0;

}