# [Poi2014]Criminals

### 题目描述

Byteburg is a beautiful town by a river. There are N houses along the river, numbered downstream wit
h successive integers from   to  . Byteburg used to be a nice quiet town in which everyone was happy
. Alas, this changed recently, as two dangerous criminals - Bitie and Bytie set up shop in it. They
did so many robberies already that the citizens are afraid to leave their houses.Bitie and Bytie do
no mere burglaries but rather whole raids: each time they leave their houses and walk towards each o
ther, never turning back. Bitie walks downstream (towards larger numbers) while Bytie walks upstream
(towards smaller numbers). Along the way, before they meet, each chooses several houses to break in
to and steal precious items (and vital data). After the robberies they meet in a house and divide th
eir loot. Byteburgers are sick of this already - they would all rather have their tranquility restor
ed. So they asked the detective Bythony for help.The detective established that the bandits live in
houses of the same color but he does not know which one. Just a moment ago, an anonymous tip claimed
that the robbers are on a raid. Fearing for their own safety, the source did not say which houses w
ill be broken into. They did however specify their colors. As it turns out, the bandits are quite su
perstitious - each of them will rob a house of each color at most once.Bythony can wait no longer. H
e intends to ambush the criminals at their meeting place. Aid Bythony in his undertaking by writing
a program to find all possible meeting places of the robbers.

### 输入格式

There are two integers in the first line of the standard input, N and K(3<=N<=1000 000,1<=K<=1000 00
0 ,K<=N), separated by a single space, that specify the number of houses and the number of house col
ors in Byteburg respectively. The colors are number with successive integers from   to K. In the sec
ond line of input, there is a sequence of N integers, C1，C2….Cn(1<=Ci<=K) , separated by single sp
aces. These are the colors of successive houses in Byteburg.In the third line of input, there are tw
o integers M and L(1<=M,L<=N,M+L<=N-1), separated by a single space, specifying the numbers of house
s (to be) broken into by Bitie and Bytie respectively. In the fourth line of input, there are   pair
wise different integers X1,X2…Xm(1<=Xi<=K), separated by single spaces. These are the colors of hou
ses robbed by Bitie in the order of being broken into (i.e., excluding Bitie's house). In the fifth,
which is the last, line of input, there are   pairwise different integers Y1,Y2…YL(1<=Yi<=K), sepa
rated by single spaces. These are the colors of houses robbed by Bytie in the order of being broken
into (again, these do not include Bytie's house). Moreover, Xm=Yi  is the color of the house in whic
h the robbers will divide the plunder. (Clearly, they have to break into that one as well!)

### 输出格式

Your program it to print exactly two lines to the standard output. The first of those should give th
e number of houses in which the criminals can meet while respecting aforementioned constraints. The
second line should contain the increasing sequence of the numbers of those houses, separated by sing
le spaces. If the robbers cannot meet at all, the first line should contain the number 0 while the s
econd one should be empty.

### 样例输入

```15 7
2 5 6 2 4 7 3 3 2 3 7 5 3 6 2
3 2
4 7 3
5 3```

```3
7 8 10

HINT

```