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

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

bitset <50001> reached;
vector <int> adjacencyList[50001];
vector <int> topologicalOrder;

void dfs(int current) {
    reached[current] = 1;
    topologicalOrder.push_back(current);
    for (int i = 0; i < adjacencyList[current].size(); i++)
        if (!reached[adjacencyList[current][i]])
            dfs(adjacencyList[current][i]);
}

int main() {
    int n, m, x, y;

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

    for (int i = 1; i <= n; i++) 
        if (!reached[i])
            dfs(i);
    
    for (int i = 0; i < n; i++)
        fout << topologicalOrder[i] << " ";
    
    return 0;
}