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

using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

int n, m, x, y, d[50002];
vector<int> v[50002];


int main()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>x>>y;
        for(auto j:v[x])
            if(i==y)
                continue;
        d[y]++;
        v[x].push_back(y);
    }
    queue<int> q;
    for(int i=1; i<=n; i++)
        if(d[i]==0)
            q.push(i);
    for(int k=1; k<=n; k++)
    {
        int j=q.front();
        for(auto i: v[j])
        {
            d[i]--;
            if(d[i]==0)
                q.push(i);
        }
        cout<<j<<" ";
        q.pop();
    }
}