#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int nmax = 100005;
int n, m, nr;
vector<int> a[nmax];
int viz[50005], d[50005];
void dfs(int node){
    viz[node] = 1;
    for(auto vecin: a[node]){
        if(viz[vecin] == 0){
            dfs(vecin);
        }
    }
    d[++nr] = node;
}
int main(){
    f >> n >> m;
    for(int i = 1; i <= m; i++){
        int x, y;
        f >> x >> y;
        a[x].push_back(y);
    }
    for(int i = 1; i <= n; i++){
        if(viz[i] == 0){
            dfs(i);
        }
    }
    for(int i = nr; i >= 1; i--){
        g << d[i] << ' ';
    }
}