## GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

## [Solution] Card Trick Codeforces Solution | Codeforces Problem Solution 2022

B. Card Trick
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Monocarp has just learned a new card trick, and can't wait to present it to you. He shows you the entire deck of $n$ cards. You see that the values of cards from the topmost to the bottommost are integers ${a}_{1},{a}_{2},\dots ,{a}_{n}$, and all values are different.

Then he asks you to shuffle the deck $m$ times. With the $j$-th shuffle, you should take ${b}_{j}$ topmost cards and move them under the remaining $\left(n-{b}_{j}\right)$ cards without changing the order.

And then, using some magic, Monocarp tells you the topmost card of the deck.

However, you are not really buying that magic. You tell him that you know the topmost card yourself. Can you surprise Monocarp and tell him the topmost card before he shows it?

Input

The first line contains a single integer $t$ ($1\le t\le {10}^{4}$) — the number of testcases.

The first line of each testcase contains a single integer $n$ ($2\le n\le 2\cdot {10}^{5}$) — the number of cards in the deck.

The second line contains $n$ pairwise distinct integers ${a}_{1},{a}_{2},\dots ,{a}_{n}$ ($1\le {a}_{i}\le n$) — the values of the cards.

The third line contains a single integer $m$ ($1\le m\le 2\cdot {10}^{5}$) — the number of shuffles.

The fourth line contains $m$ integers ${b}_{1},{b}_{2},\dots ,{b}_{m}$ ($1\le {b}_{j}\le n-1$) — the amount of cards that are moved on the $j$-th shuffle.

The sum of $n$ over all testcases doesn't exceed $2\cdot {10}^{5}$. The sum of $m$ over all testcases doesn't exceed $2\cdot {10}^{5}$.

Output

For each testcase, print a single integer — the value of the card on the top of the deck after the deck is shuffled