6406：Taotao Picks Apples

There is an apple tree in front of Taotao's house. When autumn comes, $n$ apples on the tree ripen, and Taotao will go to pick these apples.

When Taotao picks apples, Taotao scans these apples from the first one to the last one. If the current apple is the first apple, or it is strictly higher than the previously picked one, then Taotao will pick this apple; otherwise, he will not pick.

Given the heights of these apples $h_1, h_2, \cdots, h_n$, you are required to answer some independent queries. Each query is two integers $p, q$, which asks the number of apples Taotao would pick, if the height of the $p$-th apple were $q$ (instead of $h_p$). Can you answer all these queries?

The first line of input is a single line of integer $T$ $(1 \leq T \leq 10)$, the number of test cases.

Each test case begins with a line of two integers $n, m$ $(1 \leq n, m \leq 10^5)$, denoting the number of apples and the number of queries. It is then followed by a single line of $n$ integers $h_1, h_2, \cdots, h_n$ $(1 \leq h_i \leq 10^9)$, denoting the heights of the apples. The next $m$ lines give the queries. Each of these $m$ lines contains two integers $p$ $(1 \leq p \leq n)$ and $q$ $(1 \leq q \leq 10^9)$, as described in the problem statement.

For each query, display the answer in a single line.