#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

int n, m;
bool beenThere[50001];
vector <int> V[50001];
stack <int> S;

void DFS(int at)
{
    beenThere[at] = true;
    S.push(at);
    for (int i = 0; i < V[at].size(); i++)
    {
        int to = V[at][i];
        if (beenThere[to] == false)
        {
            DFS(to);
        }
    }
}

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

    for (int i = 1; i <= n; i++)
    {
        if (beenThere[i] == false)
        {
            DFS(i);
        }
    }

    while (S.empty() == false)
    {
        g << S.top() << " ";
        S.pop();
    }
}