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

const int MAX = 50005;
vector<int> graph[MAX];
int visited[MAX], topSort[MAX], k;

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

    topSort[++k] = node;
}

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

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

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

    for (int i = k; i >= 1; --i)
        fout << topSort[i] << " ";

    return 0;
}