#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
using llx = long long;

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

vector <vector <int>> v;
vector <bool> viz;
vector <int> noduri_iesire;

void dfs(int x)
{
    viz[x] = 1;
    for (const auto &y : v[x])
        if (viz[y] == 0)
            dfs(y);
    noduri_iesire.push_back(x);
}

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

    fin >> n >> m;
    v.resize(n+1);
    viz.resize(n+1);

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

    for (i = 1; i<=n; i++)
        if (viz[i] == 0)
            dfs(i);

    reverse(noduri_iesire.begin(), noduri_iesire.end());
    for (const auto &nod : noduri_iesire)
        fout << nod << ' ';
    return 0;
}