#include <fstream>
#include <vector>

using namespace std;

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

int n,m,x,y;

vector <int> graph [50002];
vector <int> graphT [50002];
char viz[50002];
int grad[50002];

void dfs (int nod){
    if (grad[nod]==0){
        viz[nod]=1;
        fout<<nod<<' ';
        int lun=graph[nod].size();
        for (int i=0; i<lun; i++){
            if (viz[graph[nod][i]]==0){
                grad[graph[nod][i]]--;
            }
        }
        return;
    }
    else{
        int lun=graphT[nod].size();
        for (int i=0; i<lun; i++){
            int vecin=graphT[nod][i];
            if (viz[vecin]==0){
                dfs(vecin);
                if (grad[nod]==0&viz[nod]==0){
                    viz[nod]=1;
                    fout<<nod<<' ';
                    int lun=graph[nod].size();
                    for (int i=0; i<lun; i++){
                        if (viz[graph[nod][i]]==0){
                            grad[graph[nod][i]]--;
                        }
                    }
                    return;
                }
            }
        }
    }
    if (grad[nod]==0&viz[nod]==0){
        fout<<nod<<' ';
        viz[nod]=1;
        return;
    }
}

int main () {
    fin>>n>>m;

    for (int i=1; i<=m; i++){
        fin>>x>>y;
        grad[y]++;
        graph[x].push_back(y);
        graphT[y].push_back(x);
    }

    for (int i=1; i<=n; i++){
        if (viz[i]==0){
            dfs(i);
        }
    }

    return 0;
}