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

using namespace std;

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

queue<int>q;

vector<int>graph[50005];
int n, m, from, to,intrati[50005],el;

int main() {
    f >> n >> m;
    for (int i = 1; i <= n; i++) {
        f >> from >> to;
        graph[from].push_back(to);
        intrati[to]++;
    }
    for (int i = 1; i <= n; i++){
        if (intrati[i] == 0)
            q.push(i);
    }
    while (!q.empty())
    {
        el=q.front();
        g << el <<' ';
        q.pop();
        for (auto it:graph[el])
        {
            if (intrati[it])
            {
                intrati[it]--;
                if (intrati[it]==0)
                    q.push(it);
            }
        }
    }

    return 0;
}