B'You are given a string s of length n , containing lowercase Latin letters. Next you will be given a positive integer k and two arrays, l and r of length k . It is guaranteed that the following conditions hold for these 2 arrays: Now you will be given a positive integer q which represents the number of modifications you need to do on s . Each modification is defined with one positive integer x : Reversing the substring [a, b] of a string s means to make s equal to s_1, s_2, ... , s_{a-1}, s_b, s_{b-1}, ... , s_{a+1}, s_a, s_{b+1}, s_{b+2}, ... , s_{n-1}, s_n . Print s after the last modification is finished. Each test contains multiple test cases. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Description of the test cases follows. The first line of each test case contains two integers n and k ( 1 <= k <= n <= 2 cdot 10^5 ) -- the length of the string s , and the length of arrays l and r . The second line of each test case contains the string s ( |s| = n ) containing lowercase Latin letters -- the initial string. The third line of each test case contains k positive integers l_1, l_2, ... , l_k ( 1 <= l_i <= n ) -- the array l . The fourth line of each test case contains k positive integers r_1, r_2, ... , r_k ( 1 <= r_i <= n ) -- the array r . The fifth line of each test case contains a positive integer q ( 1 <= q <= 2 cdot 10^5 ) -- the number of modifications you need to do to s . The sixth line of each test case contains q positive integers x_1, x_2, ... , x_q ( 1 <= x_i <= n ) -- the description of the modifications. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot10^5 . It is guaranteed that the sum of q over all test cases'...