#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

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

const int maxn = 5e4 + 5;
vector <int> G[maxn], Ans;
bitset <maxn> Vis;

void Dfs(int node) {
    vector <int> :: iterator it;
    Vis[node] = true;
    for (it = G[node].begin(); it != G[node].end(); it++) {
        if (Vis[*it] == false) {
            Dfs(*it);
        }
    }
    Ans.push_back(node);
}

int main() {
    ios_base :: sync_with_stdio (false);
    int n, m, x, y, i;
    fin >> n >> m;
    for (i = 1; i <= m; i++) {
        fin >> x >> y;
        G[x].push_back(y);
    }
    for (i = 1; i <= n; i++) {
        if (Vis[i] == false) {
            Dfs(i);
        }
    }
    for(i = n - 1; i >= 0; i-- ) {
        fout << Ans[i] << " ";
    }
    fin.close();
    fout.close();
    return 0;
}