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

using namespace std;

#define MAXN 50001

int k = 0;
int topsort[MAXN];
vector<int> g[MAXN];
bool visited[MAXN];

void dfs(int node) {
    assert(!visited[node]);
    visited[node] = true;
    for (int &u : g[node]) {
        if (!visited[u]) {
            dfs(u);
        }
    }

    topsort[k++] = node;
}

int main() {
    // stuff
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");

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

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

    for (int i = n - 1; i >= 0; i--) {
        fout << topsort[i] << ' ';
    }
    fout << '\n';

    fin.close();
    fout.close();

    return 0;
}