#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

int main() {
    int n, m, i, x, y, incoming[50001], nod;
    vector<int> G[50001];
    queue<int> q;
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i = 1; i <= n; ++i) {
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
        ++incoming[y];
    }
    for(i = 1; i <= n; ++i)
        if(incoming[i] == 0)
            q.push(i);

    while(!q.empty()) {
        nod = q.front();
        q.pop();
        for(i = 0; i < G[nod].size(); ++i) {
            --incoming[G[nod][i]];
            if(incoming[G[nod][i]] == 0)
                q.push(G[nod][i]);
        }
        printf("%d ", nod);
    }
}