Criminals

Byteburg is a town on a river. There are $n$ houses along the river, numbered from 1 to $n$ going downstream. Not long ago two dangerous criminals, Bitie and Bytie, settled in the town.

Every raid goes the same way. Each of them leaves home and walks toward the other, never turning back. Bitie walks downstream (toward larger numbers) and Bytie walks upstream (toward smaller numbers). Before they meet, each one picks some houses along the way and breaks into them. They meet in one house and split the loot there, and that house is broken into as well.

The detective Bythony established that the two criminals live in houses of the same color, but he does not know which color that is. An anonymous tip just came in. The source did not say which houses will be broken into, only the colors of those houses. The criminals are superstitious, so each of them breaks into a house of any single color at most once. A criminal's own house is never broken into, so the color he lives in may also occur among the robbed colors.

Help Bythony and find every house where the two criminals can meet.

The first line has two integers $n$ and $k$ ($3 \le n \le 1\,000\,000$, $1 \le k \le 1\,000\,000$, $k \le n$) separated by a single space, the number of houses and the number of house colors. The colors are numbered from 1 to $k$.

The second line has $n$ integers $c_1, c_2, \dots, c_n$ ($1 \le c_i \le k$) separated by single spaces. $c_i$ is the color of house $i$.

The third line has two integers $m$ and $l$ ($1 \le m, l \le n$, $m + l \le n - 1$) separated by a single space, the number of houses broken into by Bitie and by Bytie.

The fourth line has $m$ pairwise different integers $x_1, x_2, \dots, x_m$ ($1 \le x_i \le k$) separated by single spaces. They are the colors of the houses Bitie breaks into, in the order he breaks into them. Bitie's own house is not among them.

The fifth line has $l$ pairwise different integers $y_1, y_2, \dots, y_l$ ($1 \le y_i \le k$) separated by single spaces. They are the colors of the houses Bytie breaks into, in the order he breaks into them. Bytie's own house is not among them. Here $x_m = y_l$, and that color is the color of the house where the two split the loot.

On the first line print the number of houses in which the criminals can meet under the rules above. On the second line print the numbers of those houses in increasing order, separated by single spaces. If the criminals cannot meet anywhere, print 0 on the first line and leave the second line empty.

In the first example the criminals may live in houses of color 2 (Bitie in house 1 or house 4, Bytie in house 15), or in houses of color 6 (Bitie in house 3, Bytie in house 14). Whether Bitie lives in house 1 or in house 4, he can rob house 5 (color 4) and house 6 (color 7), and then go to house 7, house 8 or house 10 (all of color 3). Bytie robs house 12 (color 5) and meets Bitie in that same house. The picture below shows the case where Bitie lives in house 1 and the two meet in house 8.