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

using namespace std;

#define NMAX 50001

ifstream f("sortaret.in");
ofstream g("sortaret.out");

bool viz[NMAX];
int v;
vector<int> graf[NMAX], parc;

void DFS(int x)
{
    viz[x] = true;
    for (auto i : graf[x])
        DFS(i);
    parc.push_back(x);
}

int main()
{
    int m, x, y, i;
    f >> v >> m;
    for (i = 0; i < m; i++)
    {
        f >> x >> y;
        graf[x].push_back(y);
    }

    for (i = 1; i <= v; i++)
        if (!viz[i])
            DFS(i);

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

    for(i = 0; i < parc.size(); i++)
        g << parc[i] << " ";

    return 0;
}