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

#define maxN 50005

using namespace std;

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

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

    for (unsigned int i = 0; i < G[node].size(); ++i) {
        int neighbor = G[node][i];

        if (viz[neighbor]) {
            continue;
        }

        dfs(neighbor);
    }

    sol.push_back(node);
}

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

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

    int x, y;
    for (int i = 0; i < M; ++i) {
        f >> x >> y;

        G[x].push_back(y);
    }

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

        dfs(i);
    }

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

    for (unsigned int i = 0; i < sol.size(); ++i) {
        g << sol[i] << " ";
    }

    return 0;
}