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

using namespace std;

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

int n, m;
vector <int> Muchii[50001];
int vizitat[50001], k, rez[50001];

/*bool cmp(vec a, vec b)
{
    if (a.dist < b.dist)
        return 1;
    else if (a.dist == b.dist)
    {
        if (a.val < b.val)
            return 1;
        else
            return 0;
    }
    else
        return 0;
}*/

void DFS(int nod)
{
    int vecin;
    for (int i = 0; i < Muchii[nod].size(); ++i)
    {
        vecin = Muchii[nod][i];
        if (!vizitat[vecin])
        {
            vizitat[vecin] = vizitat[nod] + 1;
            DFS(vecin);
        }
    }
    rez[++k] = nod;
}

void citire()
{
    int x, y;
    in >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        in >> x >> y;
        Muchii[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
    {
        if (!vizitat[i])
            DFS(i);
    }
}

int main()
{
    citire();
    for (int i = k; i >= 1; --i)
        out << rez[i] << " ";
    return 0;
}