#include <bits/stdc++.h>
#define maxN 50005
using namespace std;
vector<int> v[maxN],sorted;
int n,m,i,x,y;
bool viz[maxN];
void dfs(int nod)
{
    viz[nod]=true;
    for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
        if(!viz[*it])
            dfs(*it);
    sorted.push_back(nod);
}
int main()
{
    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),
        v[x].push_back(y);
    for(i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    for(vector<int>::reverse_iterator it=sorted.rbegin();it!=sorted.rend();it++)
        printf("%d ",*it);
    return 0;
}