#include <bits/stdc++.h>
using namespace std;

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

int n, m;
vector<vector<int>> G;
vector<bool> viz;
vector<int> topSort;

void dfs(int start) {
    viz[start] = true;
    for(int x : G[start]) {
        if(!viz[x]) {
            dfs(x);
        }
    }
    topSort.push_back(start);
}

int main() {
    fin >> n >> m;
    
    G.resize(n + 1);
    viz.resize(n + 1);

    for(int x, y; m--;) {
        fin >> x >> y;
        G[x].push_back(y);
    }

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

    for(auto it = topSort.rbegin(); it != topSort.rend(); ++it) {
        fout << *it << ' ';
    }
}