#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

int n, m;
vector <int> g[50001];
int viz[50001];

void dfs(int node, vector <int> &sorted)
{
    viz[node] = true;
    for (auto vecin : g[node])
    {
        if (!viz[vecin])
        {
            dfs(vecin, sorted);
        }
    }
    sorted.push_back(node);
}

void topo_sort(vector <int> &sorted)
{
    for (int node = 1; node <= n; node++)
    {
        if (!viz[node])
            dfs(node, sorted);
    }
    reverse(sorted.begin(), sorted.end());
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
    }
    vector <int> rez;
    topo_sort(rez);
    for (auto node : rez)
        fout << node << ' ';
    return 0;
}