#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,x,y,i,nr[50010];
queue <int> q;
vector <int> v[50010];
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        nr[y]++;
    }
    for(i=1;i<=n;i++)
        if(nr[i]==0)
            q.push(i);
    while(!q.empty())
    {
        x=q.front();
        fout<<x<<' ';
        q.pop();
        for(auto it:v[x])
        {
            nr[it]--;
            if(nr[it]==0)
                q.push(it);
        }
    }

    return 0;
}