#include<iostream>
#include<algorithm>
#include<fstream>
#include<bitset>
#include<vector>
#define Nmax 50001
using namespace std;
vector<int> G[Nmax];
int N, M;
bitset<Nmax> viz;
vector<int> sol;
vector<int> part_sol;
void read_data() {
    ifstream f("sortaret.in");
    f>>N>>M;
    for(int i = 0; i < M; i++) {
        int x, y;
        f>>x>>y;
        G[x].push_back(y);
    }
    f.close();
}
void dfs(int node) {
    viz[node] = 1;
    for(auto it = G[node].begin(); it != G[node].end(); ++it) {
        if(viz[*it] == false) {
            dfs(*it);
        }
    }
    sol.push_back(node);
}
void write_data() {
    ofstream g("sortaret.out");
    for(auto it = sol.begin(); it != sol.end(); ++it) {
        g << *it << " ";
    }
    g.close();
}
int main() {
    viz.reset();
    read_data;
    for(int i = 1; i <= N; i++) {
        if(!viz[i]) {
            dfs(i);
        }
    }
    reverse(sol.begin(), sol.end());
    write_data();
    return 0;
}