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

using namespace std;

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

int nrNoduri, nrMuchii;
vector <int> *lista;
vector <int> *grafTranspus;
queue <int> sortare;
bool *vizitat;
int *grade;
int **grafNormal;

void dfs(int nodStart){

    fout << nodStart << " ";

    vizitat[nodStart] = true;

    int nrVecini = lista[nodStart].size();

    for ( int vecin = 0; vecin < nrVecini; vecin++)
                if ( !vizitat[lista[nodStart][vecin]] )
                       dfs(lista[nodStart][vecin]);



}

void dfs3(int nodStart){

        fout << nodStart << " ";

    vizitat[nodStart] = true;

    for ( int vecin = 1; vecin <= nrNoduri; vecin++)
        if ( grafNormal[nodStart][vecin] == 1 ){
                if ( !vizitat[vecin] ){
                       dfs3(vecin);
                }
        }



}

void dfs2(int nodStart){

    vizitat[nodStart] = true;

    int nrVecini = lista[nodStart].size();

    for ( int vecin = 0; vecin < nrVecini; vecin++)
                if ( !vizitat[lista[nodStart][vecin]] )
                       dfs(lista[nodStart][vecin]);

    fout << nodStart << " ";

}

void sortareTopologica(){

    while ( !sortare.empty() ){

        int nodCurent  = sortare.front();

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

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

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


        }

        fout << nodCurent << " ";

        sortare.pop();

    }

}

int main(){

    if ( !fin ){
        cout << "\nEroare la deschiderea fisierului !\n";
       // exit(-1);
    }

    fin >> nrNoduri >> nrMuchii;

//    lista = nullptr;
  //  vizitat = nullptr;
  //  grade = nullptr;

    lista = new vector<int>[nrNoduri + 5];
    grafTranspus = new vector<int>[nrNoduri + 5];
    vizitat = new bool[nrNoduri + 5];
    grade = new int[nrNoduri + 5];

    grafNormal = new int*[nrNoduri + 5];

    for ( int i = 0 ; i < nrNoduri + 5; i++)
        grafNormal[i] = new int[nrNoduri + 5];

    for (int i = 1; i <= nrNoduri; i++)
        for ( int j = 1; j <= nrNoduri; j++)
            grafNormal[i][j] = 0;


    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;

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

        grafNormal[x][y] = 1;

    }

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

   // sortareTopologica();

    for ( int i = 1; i <= nrNoduri; i++)
        if ( !vizitat[i] )
                    dfs3(i);

  /*  for (int i = 1; i <= nrNoduri; i++){
        for ( int j = 1; j <= nrNoduri; j++)
           cout <<  grafNormal[i][j] << " ";
           cout << endl;
    }*/
/*
    for ( int i = 0; i < nrNoduri; i++){

        cout << i + 1<<": ";

        for ( int j = 0; j < lista[i].size(); j++)
            cout << lista[i][j] + 1 << " ";
        cout << "\n";
    }
*/

    return 0;

}