#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;

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

const int MAXN = 50005;
int n, m;
vector<int> v[MAXN];
bool viz[MAXN];
vector<int> sol;

void dfs(int k) {
    viz[k] = 1;
    for (int j = 0; j < v[k].size(); ++j) {
        int node = v[k][j];
        if (viz[node] == 0) {
            dfs(node);
        }
    }
    sol.push_back(k);
}

int main() {

    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
    }

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

    for (int i = sol.size() - 1; i >= 0; --i) {
        fout << sol[i] << ' ';
    }

    fout.close();
    return 0;
}