#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

queue <int> q;
vector <int> a[50001];
int nrp[50001], d[50001], v[50001], n, m, j;

void bfs()
{
    int x, y;
    unsigned int i;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0;i<a[x].size();i++)
        {
            y=a[x][i];
            nrp[y]--;
            if(!nrp[y] && !d[y])
            {
                v[++j]=y;
                q.push(y);
                d[y]=d[x]+1;
            }
        }
    }
}

int main()
{
    int i, x, y;
    in>>n>>m;
    for(i=1;i<=n;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        nrp[y]++;
    }
    for(i=1;i<=n;i++)
    {
        if(!nrp[i])
        {
            q.push(i);
            v[++j]=i;
        }
    }
    bfs();
    for(i=1;i<=n;i++) out<<v[i]<<" ";
    return 0;
}