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

using namespace std;

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

int n, m;
bool vizitat[50001];
vector <int> V[50001];
vector <int> vector1;

void DFS(int nod)
{
    vizitat[nod] = true;
    vector1.push_back(nod);
    for (int i = 0; i < V[nod].size(); i++)
    {
        int vecin = V[nod][i];
        if (vizitat[vecin] == false)
        {
            DFS(vecin);
        }
    }
}

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 (vizitat[i] == false)
        {
            DFS(i);
        }
    }
    for (int i = 0; i < vector1.size(); i++)
    {
        g << vector1[i] << " ";
    }
}