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

using namespace std;

#define maxN 50005

bool viz[maxN];
vector <int> list[maxN], sol;


void dfs(int nod) {
    viz[nod] = true;

    for(unsigned int i = 0; i < list[nod].size(); ++ i) {
        int nod2 = list[nod][i];
        if(viz[nod2]) continue;

        dfs(nod2);
    }

    sol.push_back(nod);
}

int main() {
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");

    int N, M;
    f >> N >> M;

    while(M --) {
        int x, y;
        f >> x >> y;

        list[x].push_back(y);
    }

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

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

    return 0;
}