#include<bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> v[50010];
int i,a,b,n,m,k,sol[50010],f[50010],d[50010];
void dfs(int nod)
{
    d[nod]=1;
    for(auto it:v[nod]) if(d[it]==0) dfs(it);
    sol[++k]=nod;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
        f[b]++;
    }
    for(i=1;i<=n;i++) if(f[i]==0) dfs(i);
    for(i=n;i>=1;i--) fout<<sol[i]<<" ";
    return 0;
}