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

using namespace std;

#define NMAX 100005

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

int nrNoduri, nrMuchii;
vector <int> graf[NMAX];
bool vizitat[NMAX];
vector <int> afisare;

void dfs(int nodStart){

    vizitat[nodStart] = true;

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

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

    afisare.push_back(nodStart);

}

int main(){

    fin >> nrNoduri >> nrMuchii;

    for ( int i = 1; i <= nrNoduri; i++)
                    vizitat[i] = false;

    for ( int i = 1; i <= nrMuchii; i++){
            int x,y;
            fin >> x >> y;
            graf[x].push_back(y);
    }

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

    for ( int i = afisare.size() - 1; i >= 0; i-- )
        fout << afisare[i] << " ";

    return 0;

}