#include <bits/stdc++.h>

using namespace std;

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

const int oo = (1 << 30);
const int NMAX = 50005;

int n, m;
vector<int>G[NMAX];
vector<int>ans;
queue<int>coada;
int grad_exterior[NMAX];

void citeste()
{
    fin>>n>>m;
    for(int i = 1; i <= n; i++){
        int x, y;
        fin>>x>>y;
        G[x].push_back(y);
        grad_exterior[y]++;
    }
}

void rezolva()
{
    for(int i = 1; i <= n; i++){
        if(grad_exterior[i] == 0){
            coada.push(i);
        }
    }
    while(!coada.empty()){
        int k = coada.front();
        ans.push_back(k);
        coada.pop();
        for(auto it = G[k].begin(); it != G[k].end(); it++){
            grad_exterior[*it]--;
            if(grad_exterior[*it] == 0){
                coada.push(*it);
            }
        }
    }
}

void afiseaza()
{
    for(int i = 0; i < n; i++){
        fout<<ans[i]<<" ";
    }
}

int main()
{
    citeste();
    rezolva();
    afiseaza();
    return 0;
}