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

using namespace std;

const int maxn = 50005;

vector<int> g[maxn];
int viz[maxn];
vector<int> sol;

void dfs(int nod) {
    viz[nod] = 1;
    for (int j = 0; j < g[nod].size(); ++j) {
        int vecin = g[nod][j];
        if (!viz[vecin])
            dfs(vecin);
    }
    sol.push_back(nod);
}

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

    int n, m;
    in >> n >> m;

    for (int i = 1; i <= m; ++i) {
        int x, y;
        in >> x >> y;
        g[x].push_back(y);
    }

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

    reverse(sol.begin(), sol.end());

    for (int i = 0; i < sol.size(); ++i)
        out << sol[i] << " ";

    return 0;
}