#include <bits/stdc++.h>

using namespace std;

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

constexpr int NMAX = 5e4 + 2;

vector <int> G[NMAX];
int topsort[NMAX];
bool sel[NMAX];
int n, m;

void dfs(int node)
{
    sel[node] = true;
    for(auto it: G[node])
        if(!sel[it])
            dfs(it);
    topsort[++topsort[0]] = node;

    return;
}

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

    for(int i = 1; i <= n; i++) {
        if(!sel[i])
            dfs(i);
    }
    for(int i = n; i > 0; i --)
        fout << topsort[i] << " ";
    return 0;
}