#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>


using namespace std;

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

using VI = vector<int>;
using VVI = vector<VI>;

VI topSort;
VVI G;
vector<bool> vis;

void TopologicSort(int x)
{
    vis[x] = true;
    for (auto y : G[x])
    {
        if (!vis[y])
            TopologicSort(y);
    }

    topSort.emplace_back(x);
}

int main()
{
    int n, m;
    fin >> n >> m;
    G = VVI(n + 1);
    vis = vector<bool>(n + 1);
    topSort.reserve(n + 1);

    int x, y;

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


    for (int i = 1; i <= n; ++i)
        if (!vis[i])
            TopologicSort(i);

    reverse(topSort.begin(), topSort.end());

    for (auto i : topSort)
        fout << i << ' ';
}