#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<vector<int>> vec;
vector<int>solutie;
vector<int> viz(1e6,0);
void dfs(int i) {
    viz[i]=1;
    for (auto j : vec[i]) {
        if (viz[j]==0) {
            dfs(j);
        }
    }
        solutie.push_back(i);
}
int main() {
    int n, m;
    fin>>n>>m;
    vec.resize(n+1);
    for (int i=1;i<=m;i++) {
        int a, b;
        fin>>a>>b;
        vec[a].push_back(b);
    }
    for (int i=1;i<=n;i++) {
        if (viz[i]==0) dfs(i);
    }
    for (int i=solutie.size()-1;i>=0;i--) fout<<solutie[i]<<" ";
    return 0;
}