#include <bits/stdc++.h>

using namespace std;

const int kNmax = 1e5 + 5;

vector<int> adj[kNmax];

void dfs(int source, vector<int>& topsort, vector<bool>& visited) {
    visited[source] = true;
    for(auto vecin : adj[source]) {
        if(visited[vecin] == true)
            continue;
        dfs(vecin, topsort, visited);
    }
    topsort.push_back(source);
}

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

    int n, m;
    fin>>n>>m;

    vector<int> topsort;
    vector<bool> visited(n + 1, false);

    for(int i = 1; i <= m; i++) {
        int x, y;
        fin>>x>>y;
        adj[x].push_back(y);
    }

    for(int i = 1; i <= n; i++) {
        if(visited[i] == true)
            continue;
        dfs(i, topsort, visited);
    }

    reverse(topsort.begin(), topsort.begin());
    for(int i = 0; i < topsort.size(); i++) {
        fout<<topsort[i]<<" ";
    }

    return 0;
}