CF34D.Road Map

There are n cities in Berland. Each city has its index — an integer number from 1 to n. The capital has index _r_1. All the roads in Berland are two-way. The road system is such that there is exactly one path from the capital to each city, i.e. the road map looks like a tree. In Berland's chronicles the road map is kept in the following way: for each city i, different from the capital, there is kept number p__i — index of the last city on the way from the capital to i.

Once the king of Berland Berl XXXIV decided to move the capital from city _r_1 to city _r_2. Naturally, after this the old representation of the road map in Berland's chronicles became incorrect. Please, help the king find out a new representation of the road map in the way described above.

贝兰国有 $n$ 座城市。每座城市都有一个编号——一个从 $1$ 到 $n$ 的整数。首都的编号为 $r_1$。贝兰国的所有道路均为双向道路。道路系统满足：从首都到任意一座城市的路径恰好有一条，即道路地图构成一棵树。在贝兰国的编年史中，道路地图以如下方式保存：对每个不同于首都的城市 $i$，记录一个数 $p_i$ —— 即从首都到城市 $i$ 的唯一路径上，$i$ 的前一个城市（即路径上 $i$ 的父节点）的编号。

某日，贝兰国国王贝尔 XXXIV 决定将首都从城市 $r_1$ 迁至城市 $r_2$。显然，迁都后，编年史中原来保存的道路地图表示方式便不再正确。请帮助国王求出迁都后、按上述方式表示的新道路地图。

The first line contains three space-separated integers n, _r_1, _r_2 (2 ≤ n ≤ 5·104, 1 ≤ _r_1 ≠ _r_2 ≤ n) — amount of cities in Berland, index of the old capital and index of the new one, correspondingly.

The following line contains n - 1 space-separated integers — the old representation of the road map. For each city, apart from _r_1, there is given integer p__i — index of the last city on the way from the capital to city i. All the cities are described in order of increasing indexes.

第一行包含三个以空格分隔的整数 $n$、$r_1$、$r_2$（$2 \leq n \leq 5\cdot10^4$，$1 \leq r_1 \ne r_2 \leq n$），分别表示贝尔兰的城市数量、旧首都的编号以及新首都的编号。

接下来一行包含 $n-1$ 个以空格分隔的整数——即道路图的旧表示法。对于除 $r_1$ 外的每个城市 $i$，给出一个整数 $p_i$，表示从首都到城市 $i$ 的路径上 $i$ 的前一个城市（即父节点）的编号。所有城市按编号升序依次描述。

Output n - 1 numbers — new representation of the road map in the same format.

输出 $n-1$ 个数——以相同格式表示的道路地图的新表示。