#include <bits/stdc++.h>
#define ll long long
using namespace std;

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

const int N_MAX = 50005;

vector<int>g[N_MAX] , v;
int n , m;
bool used[N_MAX];

void dfs (int node){
    used[node] = true;
    for (auto i : g[node]){
        if (used[i] == false){
            dfs(i);
        }
    }
    v.push_back(node);
}

int main(){
    ios_base::sync_with_stdio(false);
    fin >> n >> m;
    for (int i=1; i<=m; i++){
        int x , y; fin >> x >> y;
        g[x].push_back(y);
    }
    for (int i=1; i<=n; i++){
        if (used[i] == false){
            dfs(i);
        }
    }
    reverse(v.begin() , v.end());
    for (auto x : v){
        fout << x << " ";
    }
}