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

const int MAX = 50005;
vector<int> graph[MAX], tp;
bitset<MAX> visited;

void solve(int node)
{
    visited[node] = 1;
    for (int next : graph[node])
        if (!visited[next])
            solve(next);

    tp.push_back(node);
}

int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n, m;
    cin >> n >> m;

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

    for (int i = 1; i <= n; ++i)
        if (!visited[i])
            solve(i);

    reverse(tp.begin(), tp.end());
    for (auto x : tp)
        cout << x << " ";

    return 0;
}