#include<cstdio>
#include<vector>
using namespace std;

int result[50001]={0};

void search(vector<int> edge[],int from,int to)
{
  result[to]=from;
  for(int i=0;i<edge[to].size();i++)
    {
      if(from!=edge[to][i])
	search(edge,to,edge[to][i]);
    }

}
int main()
{
  int n,r1,r2;
  scanf("%d%d%d",&n,&r1,&r2);
  vector<int> edge[n+1];
  for(int i=1;i<=n;i++)
    {
      int t;
      if(r1==i)
	continue;
      scanf("%d",&t);
      edge[i].push_back(t);
      edge[t].push_back(i);
    }

  for(int i=0;i<edge[r2].size();i++)
    {
      search(edge,r2,edge[r2][i]);
    }

  for(int i=1;i<=n;i++)
    {
      if(i==r2)
	continue;

      printf("%d ",result[i]);
    }

  puts("");
  return 0;
}