B'This is the easy version of the problem. The difference between the versions is that the easy version has no swap operations. You can make hacks only if all versions of the problem are solved. Pikachu is a cute and friendly pok xc3 xa9mon living in the wild pikachu herd. But it has become known recently that infamous team R wanted to steal all these pok xc3 xa9mon! Pok xc3 xa9mon trainer Andrew decided to help Pikachu to build a pok xc3 xa9mon army to resist. First, Andrew counted all the pok xc3 xa9mon -- there were exactly n pikachu. The strength of the i -th pok xc3 xa9mon is equal to a_i , and all these numbers are distinct. As an army, Andrew can choose any non-empty subsequence of pokemons. In other words, Andrew chooses some array b from k indices such that 1 <= b_1 < b_2 < ... < b_k <= n , and his army will consist of pok xc3 xa9mons with forces a_{b_1}, a_{b_2}, ... , a_{b_k} . The strength of the army is equal to the alternating sum of elements of the subsequence; that is, a_{b_1} - a_{b_2} + a_{b_3} - a_{b_4} + ... . Andrew is experimenting with pok xc3 xa9mon order. He performs q operations. In i -th operation Andrew swaps l_i -th and r_i -th pok xc3 xa9mon. Note: q=0 in this version of the task. Andrew wants to know the maximal stregth of the army he can achieve with the initial pok xc3 xa9mon placement. He also needs to know the maximal strength after each operation. Help Andrew and the pok xc3 xa9mon, or team R will realize their tricky plan! Each test contains multiple test cases. The first line contains one positive integer t ( 1 <= t <= 10^3 ) denoting the number of test cases. Description of the test cases follows. The first line of each test case contains two integers n and q ( 1 <= n <= 3 cdot 10^5, q = 0 ) denoting the number of pok xc3 xa9mon and number of operations respectively. The second line contains n distinct positive integers a_1, a_2, ... , a_n ( 1 <= a_i <= n ) denoti'...