# include <cstdio>
# include <vector>
# define MAXN 50001
# define pb push_back
# include <stack>
using namespace std;
int n,m,x,y,viz[MAXN],k,sol[MAXN];
vector <int>G[MAXN];
stack <int>st;
void dfs(int x)
{
    int i;
    viz[x]=1;
    for(i=0;i<G[x].size();i++)
        if(!viz[G[x][i]]) dfs(G[x][i]);
    st.push(x);
}
int main()
{
    int i;
    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);
        G[x].pb(y);
    }
    for(i=1;i<=n;i++)
        if(!viz[i]) dfs(i);
    while(!st.empty())
    {
        printf("%d ",st.top());
        st.pop();
    }
    return 0;
}