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

using namespace std;

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

vector <int> v[50010];
int grad[50010];
queue <int> q;

int n, m, x, y, nod;
int topo[50010], poz;

int main() {
    fin >> n >> m;
    for (int i=1; i<=n; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
        grad[y]++;
    }
    for (int i=1; i<=n; i++)
        if (grad[i] == 0)
            q.push(i);
    poz = 0;
    while (!q.empty( ))
    {
        nod = q.front( );
        topo[++poz] = nod;
        q.pop();
        for (auto it: v[nod])
        {
            grad[it]--;
            if (grad[it] == 0)
                q.push(it);
        }
    }
    for (int i=1; i<=n; i++)
        fout << topo[i] << ' ' ;
    return 0;
}