B'There are n of independent carriages on the rails. The carriages are numbered from left to right from 1 to n . The carriages are not connected to each other. The carriages move to the left, so that the carriage with number 1 moves ahead of all of them. The i -th carriage has its own engine, which can accelerate the carriage to a_i km/h, but the carriage cannot go faster than the carriage in front of it. See example for explanation. All carriages start moving to the left at the same time, and they naturally form trains. We will call trains -- consecutive moving carriages having the same speed. For example, we have n=5 carriages and array a = [10, 13, 5, 2, 6] . Then the final speeds of the carriages will be [10, 10, 5, 2, 2] . Respectively, 3 of the train will be formed. There are also messages saying that some engine has been corrupted: Messages arrive sequentially, the processing of the next message takes into account the changes from all previous messages. After each message determine the number of formed trains. The first line of input data contains a single integer t ( 1 <= t <= 10^4 ) --the number of input test cases. This is followed by descriptions of the test cases. The first line of each test case is empty. The second line of the test case contains two integers n and m ( 1 <= n,m <= 10^5 ) --the number of carriages and the number of messages to slow down the carriage, respectively. The third line contains n integers: a_1, a_2, ... , a_n ( 0 <= a_i <= 10^9 ) -- the number a_i means that the carriage with number i can reach a speed of a_i km/h. The next m lines contain two integers k_j and d_j ( 1 <= k_j <= n , 0 <= d_j <= a_{k_j} ) --this is the message that the speed of the carriage with number k_j has decreased by d_j . In other words, there has been a change in its maximum'...