#include <bits/stdc++.h>

using namespace std;

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

int n, m, mat[100][100];
int viz[101];
int sol[100];

void dfs(int x){
    viz[x] = 1;
    for(int i = 1;i <= n; i++){
        if(mat[x][i] == 1){
            if(viz[i] == 0){
                dfs(i);
            }
        }
    }
    sol[++sol[0]] = x;
}

void top_sort(){
    for(int i = 1; i <= n; i++){
        if(viz[i] == 0){
            dfs(i);
        }
    }
    for(int i = sol[0]; i >= 1; i--){
        out << sol[i] << " ";
    }
}

void citire(){
    in >> n >> m;
    for(int i = 1; i <= m; i++){
        int x, y;
        in >> x >> y;
        mat[x][y] = 1;
    }
}

int main() {
    citire();
    top_sort();
    return 0;
}