Dateri is a smart boy who is thirsty for making a big fortune. Recently, he decides to invest in stocks to try his luck. Unfortunately, due to the miserable state of the economy and lack of knowledge and experience, he suffered a great loss of money. He has no choice but to ask LowbieH for help. LowbieH offers him a predictor which can forecast the stock index of the upcoming \(n\) days. Dateri is very excited and can't wait to make money. He wants to know the minimum days that he needs to wait to get a rise in the index if making a buy-in on the \(k_{th}\) day.

The first line is an integer \(T(1\leq T \leq 12)\), meaning the number of the test cases.

For each test case, an integer \(n(1\leq n \leq 2*10^5)\) denotes the number of the forecasted upcoming days, followed by \(n\) stock indexes for each day: \(index_1,\cdots,index_{n}(1\leq index_i \leq 10^9, 1\leq i \leq n)\).

The next line contains an integer \(q(1\leq q \leq 2*10^5)\) denoting the number of the queries. For each query, there's an integer \(k\), which means that Dateri will make a buy-in on the \(k_{th}\) day.

Print the answer of each query in \(q\) lines. If Dateri can't get a rise within the upcoming \(n\) days, print \(-1\).

"rise" should be understanded as "strictly bigger than".

Huge input and output. You are recommended to use fast I/O.