#include <bits/stdc++.h>

using namespace std;

const int NMAX = 50001;

vector <int> v[NMAX];

int viz[NMAX];
vector <int> stiva;

void DFS(int node){
    viz[node] = 1;
    for(auto x : v[node]){
        if(!viz[x])
        DFS(x);
    }
    stiva.push_back(node);
}

int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n, m, i;
    cin >> n >> m;
    for(i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
    }
    for(i = 1; i <= n; i++){
        if(!viz[i]){
            DFS(i);
        }
    }
    reverse(stiva.begin(), stiva.end());
    for(auto x : stiva)
        cout << x << " ";
    return 0;
}