#include <iostream>
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

const int NMAX = 50000;

int n, m;
bool viz[NMAX + 5];
vector <int> ans, incoming;
vector <vector <int> > graph;

void dfs(int node)
{
    viz[node] = 1;
    for(auto neighbor : graph[node])
        if(!viz[neighbor])
            dfs(neighbor);
    ans.pb(node);
}

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    cin >> n >> m;
    graph.resize(n + 1);
    incoming.resize(n + 1);

    for (int i = 1; i <= m; i ++)
    {
        int a, b;
        cin >> a >> b;
        graph[a].pb(b);
        incoming[b] ++;
    }

    for(int node = 1; node <= n; node ++)
    {
        if(incoming[node] == 0  &&  !viz[node])
            dfs(node);
    }

    reverse(ans.begin(), ans.end());
    for(auto x : ans)
        cout << x << " ";
    return 0;
}