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!)

第一行两个正整数N和K（K<=N<=1000000）分别代表序列长度和颜色总数。第二行给出n个正整数Ci（1<=Ci<=K）。

第三行给出了两个正整数M和L（1<=M,L<=N，M+L<=N-1）分别代表两个人所取走的颜色序列长度。第四行M个数是第

一个人的颜色序列（从左往右）。第五行L个数是第二个人的颜色序列（从右往左）,注意颜色序列里没有重复数字.

注意：两个人的出发点的颜色必须相同，他们不能在出发点上面取颜色（不是说出发点上的颜色不能取）