Problem: 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émon living in the wild pikachu herd.

But it has become known recently that infamous team R wanted to steal all these pokémon! Pokémon trainer Andrew decided to help Pikachu to build a pokémon army to resist.

First, Andrew counted all the pokémon — there were exactly n pikachu. The strength of the i-th pokémon 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émons 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émon order. He performs q operations. In i-th operation Andrew swaps l_i-th and r_i-th pokémon.

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émon placement. He also needs to know the maximal strength after each operation.

Help Andrew and the pokémon, or team R will realize their tricky plan!

Input

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 ⋅ 10^5, q = 0) denoting the number of pokémon and number of operations respectively.

The second line contains n distinct positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n) denoting the strengths of the pokémon.

i-th of the last q lines contains two positive integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n) denoting the indices of pokémon that were swapped in the i-th operation.

It is guaranteed that the sum of n over all test cases does not exceed 3 ⋅ 10^5, and the sum of q over all test cases does not exceed 3 ⋅ 10^5. 

Output

For each test case, print q+1 integers: the maximal strength of army before the swaps and after each swap.

Example

Input


3
3 0
1 3 2
2 0
1 2
7 0
1 2 5 4 3 6 7


Output


3
2
9

Note

In third test case we can build an army in such way: [1 2 5 4 3 6 7], its strength will be 5−3+7=9.

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
import java.util.stream.Stream;

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        solve(in, out);
        out.close();
    }

    static String reverse(String s) {
        return (new StringBuilder(s)).reverse().toString();
    }

    static void sieveOfEratosthenes(int n, int factors[]) 
    { 
        factors[1]=1;
        for(int p = 2; p*p <=n; p++) 
        { 
            if(factors[p] == 0) 
            { 
                factors[p]=p;
                for(int i = p*p; i <= n; i += p) 
                    factors[i] = p; 
            } 
        } 
    }

    static void sort(int ar[]) {
        int n = ar.length;
        ArrayList<Integer> a = new ArrayList<>();
        for (int i = 0; i < n; i++)
            a.add(ar[i]);
        Collections.sort(a);
        for (int i = 0; i < n; i++)
            ar[i] = a.get(i);
    }

    static void sort1(long ar[]) {
        int n = ar.length;
        ArrayList<Long> a = new ArrayList<>();
        for (int i = 0; i < n; i++)
            a.add(ar[i]);
        Collections.sort(a);
        for (int i = 0; i < n; i++)
            ar[i] = a.get(i);
    }

    static long ncr(long n, long r, long mod) {
        if (r == 0)
            return 1;
        long val = ncr(n - 1, r - 1, mod);
        val = (n * val) % mod;
        val = (val * modInverse(r, mod)) % mod;
        return val;
    }

    static class SegTree{
        SegTree left, right;
        long pp;
        long pn;
        long np;
        long nn;
        int i,j;
        SegTree(int i, int j){
            this.i = i;
            this.j = j;
            left = null;
            right = null;
            pp = pn = np = nn = 0;
        }
    }

    static SegTree construct(int i, int j, int a[]){
        SegTree node = new SegTree(i,j);
        if(i!=j){
            node.left = construct(i,(i+j)/2,a);
            node.right = construct((i+j)/2+1,j,a);
            node.pp = Math.max(Math.max(node.left.pp,node.right.pp),Math.max(node.left.pp+node.right.np,
            node.left.pn+node.right.pp));
            node.pn = Math.max(Math.max(node.left.pn,node.right.pn),Math.max(node.left.pn+node.right.pn,
            node.left.pp+node.right.nn));
            node.np = Math.max(Math.max(node.left.np,node.right.np),Math.max(node.left.np+node.right.np,
            node.left.nn+node.right.pp));
            node.nn = Math.max(Math.max(node.left.nn,node.right.nn),Math.max(node.left.nn+node.right.pn,
            node.left.np+node.right.nn));
        }
        else{
            node.pp = a[i];
            node.np = Integer.MIN_VALUE;
            node.pn = Integer.MIN_VALUE;
            node.nn = -1*a[i];
        }
        return node;
    }

    static void update(int l, int v, SegTree node){
        if(node.i==l&&node.j==l){
            node.pp = v;
            node.nn = -v;
            return;
        }
        int mid = (node.i+node.j)/2;
        if(mid>=l){
            update(l,v,node.left);
            node.pp = Math.max(Math.max(node.left.pp,node.right.pp),Math.max(node.left.pp+node.right.np,
            node.left.pn+node.right.pp));
            node.pn = Math.max(Math.max(node.left.pn,node.right.pn),Math.max(node.left.pn+node.right.pn,
            node.left.pp+node.right.nn));
            node.np = Math.max(Math.max(node.left.np,node.right.np),Math.max(node.left.np+node.right.np,
            node.left.nn+node.right.pp));
            node.nn = Math.max(Math.max(node.left.nn,node.right.nn),Math.max(node.left.nn+node.right.pn,
            node.left.np+node.right.nn));
            return;
        }
        else{
            update(l,v,node.right);
            node.pp = Math.max(Math.max(node.left.pp,node.right.pp),Math.max(node.left.pp+node.right.np,
            node.left.pn+node.right.pp));
            node.pn = Math.max(Math.max(node.left.pn,node.right.pn),Math.max(node.left.pn+node.right.pn,
            node.left.pp+node.right.nn));
            node.np = Math.max(Math.max(node.left.np,node.right.np),Math.max(node.left.np+node.right.np,
            node.left.nn+node.right.pp));
            node.nn = Math.max(Math.max(node.left.nn,node.right.nn),Math.max(node.left.nn+node.right.pn,
            node.left.np+node.right.nn));
            return;
        }
    }

    public static void solve(InputReader sc, PrintWriter pw) {
        int i, j = 0;
        // int t = 1;  
        int t = sc.nextInt();
        u: while (t-- > 0) {
            int n = sc.nextInt();
            int q = sc.nextInt();
            int a[] = new int[n+2];
            for(i=1;i<=n;i++){
                a[i] = sc.nextInt();
            }
            a[0] = a[n+1] = Integer.MIN_VALUE;
            int max[] = new int[n+2];
            int min[] = new int[n+2];
            long val = 0;
            for(i=1;i<=n;i++){
                if(a[i]>a[i-1]&&a[i]>a[i+1]){
                    max[i] = 1;
                    val += a[i];
                }
                if(a[i]<a[i-1]&&a[i]<a[i+1]){
                    min[i] = 1;
                    val -= a[i];
                }
            }
            pw.println(val);
            while(q-->0){
                int y = sc.nextInt();
                int z = sc.nextInt();
                if(y!=z){
                    if(z>y+2){
                        for(i=y-1;i<=y+1;i++){
                            if(min[i]==1){
                                val += a[i];
                                min[i] = 0;
                            }
                            if(max[i]==1){
                                val -= a[i];
                                max[i] = 0;
                            }
                        }
                        for(i=z-1;i<=z+1;i++){
                            if(min[i]==1){
                                val += a[i];
                                min[i] = 0;
                            }
                            if(max[i]==1){
                                val -= a[i];
                                max[i] = 0;
                            }
                        }
                        a[y] = a[y] ^ a[z];
                        a[z] = a[y] ^ a[z];
                        a[y] = a[y] ^ a[z];
                        for(i=y-1;i<=y+1;i++){
                            if(i>0&&i<=n&&a[i]>a[i-1]&&a[i]>a[i+1]){
                                val += a[i];
                                max[i] = 1;
                            }
                            if(i>0&&i<=n&&a[i]<a[i-1]&&a[i]<a[i+1]){
                                val -= a[i];
                                min[i] = 1;
                            }
                        }
                        for(i=z-1;i<=z+1;i++){
                            if(i>0&&i<=n&&a[i]>a[i-1]&&a[i]>a[i+1]){
                                val += a[i];
                                max[i] = 1;
                            }
                            if(i>0&&i<=n&&a[i]<a[i-1]&&a[i]<a[i+1]){
                                val -= a[i];
                                min[i] = 1;
                            }
                        }
                    }
                    else{
                        for(i=y-1;i<=z+1;i++){
                            if(min[i]==1){
                                val += a[i];
                                min[i] = 0;
                            }
                            if(max[i]==1){
                                val -= a[i];
                                max[i] = 0;
                            }
                        }
                        a[y] = a[y] ^ a[z];
                        a[z] = a[y] ^ a[z];
                        a[y] = a[y] ^ a[z];
                        for(i=y-1;i<=z+1;i++){
                            if(i>0&&i<=n&&a[i]>a[i-1]&&a[i]>a[i+1]){
                                val += a[i];
                                max[i] = 1;
                            }
                            if(i>0&&i<=n&&a[i]<a[i-1]&&a[i]<a[i+1]){
                                val -= a[i];
                                min[i] = 1;
                            }
                        }
                    }
                }
                pw.println(val);
            }
        }
    }

    static class Pair implements Comparable<Pair> {
        int a;
        int b;
        int c;
        
        Pair(int a, int b, int c) {
            this.a = a;
            this.b = b;
            this.c = c;
        }
 
        public int compareTo(Pair p) {
            // if(a!=p.a)
            //     return a-p.a;
            return c-p.c;
        }
    }

    static boolean isPrime(long n) {
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;
        if (n % 2 == 0 || n % 3 == 0)
            return false;
        for (int i = 5; i * i <= n; i = i + 6)
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        return true;
    }

    static long gcd(long a, long b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    static long fast_pow(long base, long n, long M) {
        if (n == 0)
            return 1;
        if (n == 1)
            return base % M;
        long halfn = fast_pow(base, n / 2, M);
        if (n % 2 == 0)
            return (halfn * halfn) % M;
        else
            return (((halfn * halfn) % M) * base) % M;
    }

    static long modInverse(long n, long M) {
        return fast_pow(n, M - 2, M);
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }
    }
}