B"You have a card deck of n cards, numbered from top to bottom, i. e. the top card has index 1 and bottom card -- index n . Each card has its color: the i -th card has color a_i . You should process q queries. The j -th query is described by integer t_j . For each query you should: The first line contains two integers n and q ( 2 <= n <= 3 cdot 10^5 ; 1 <= q <= 3 cdot 10^5 ) -- the number of cards in the deck and the number of queries. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 50 ) -- the colors of cards. The third line contains q integers t_1, t_2, ... , t_q ( 1 <= t_j <= 50 ) -- the query colors. It's guaranteed that queries ask only colors that are present in the deck. Print q integers -- the answers for each query. Description of the sample: "...