#include <fstream>
#include <vector>

using namespace std;

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

int n, m, i, x, y, k, sol[50005], viz[50005];
bool v[50005];
vector < int > L[50005];

void dfs (int nod){
    int vecin;
    viz[nod] = 1;
    for (int i=0; i<L[nod].size(); i++){
        vecin = L[nod][i];
        if (viz[vecin] == 0){
            dfs(vecin);
        }
    }
    sol[++k] = nod;
}

int main(){
    fin >> n >> m;
    for (i=1; i<=m; i++){
        fin >> x >> y;
        L[x].push_back(y);
        v[y] = true;
    }
    for (i=1; i<=n; i++){
        if (v[i] == false){
            dfs(i);
        }
    }
    for (i=n; i>=1; i--)
        fout << sol[i] << " ";
    return 0;
}