405853: GYM102135 F The closest subsequence

Given an array A consisting of n integers, and some number k. You are required to find such a subsequence of A that its median m will be as close as possible to the number k, i.e. |m - k| is minimal, and this subsequence has maximum length among all such subsequences.

The median of the array X of length len is the number in the array X (x_i ≤ x_i + 1) at position , when array is sorted in the nondecreasing order. Let us assume that the array X indices start from 1.

The first line contains two integers n and k (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10⁹) — the array A size and the number, which is meant to be the closest to the median, respectively.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — array A elements.

The first line contains one integer l (1 ≤ len ≤ n) — the subsequence size.

The second line contains len integers p₁, p₂, ..., p_len (1 ≤ p_i ≤ n, p_i < p_i + 1) — the indices of the array A elements included in this subsequence.

5 3
1 2 3 4 5

5
1 2 3 4 5

5 42
1 2 3 4 5

1
5