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.*;
import java.util.*;
import java.math.*;
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    //class  Declaration
 
static class pair implements Comparable < pair > {
    long x;
    long y;
    pair(long i, long j) {
        x = i;
        y = j;
    }
    public int compareTo(pair p) {
        if (this.x != p.x) {
            return Long.compare(this.x,p.x);
        } else {
            return Long.compare(this.y,p.y);
        }
    }
    public int hashCode() {
        return (x + " " + y).hashCode();
    }
    public String toString() {
        return x + " " + y;
    }
    public boolean equals(Object o) {
        pair x = (pair) o;
        return (x.x == this.x && x.y == this.y);
    }
}

// int[] dx = {0,0,1,-1};
// int[] dy = {1,-1,0,0};
// int[] ddx = {0,0,1,-1,1,-1,1,-1}; 
// int[] ddy = {1,-1,0,0,1,-1,-1,1};
 
final int inf = (int) 1e9 + 9;
final long biginf  = (long)1e18 + 7 ;
final long mod =  (long)1e9+7;  

int n;
void solve() throws Exception {
    int T=ni();
    while(T-->0){
         n=ni();
         int q=ni();
        long[] arr = new long[n+2];
        for(int i=1;i<=n;++i) arr[i]=ni();
        long ans = 0;
        long fa  =0;
        for(int i=1;i<=n;++i){
            if(isHigh(i,arr)){
                ans += arr[i];
            }

            if(isLow(i,arr)){
                ans -= arr[i];
            }
            fa = Math.max(ans,fa);
        }
        fa=Math.max(ans,fa);

        pn(ans);

        while(q-->0){


            int l=ni(),r=ni();

            long la =ans;
           

            if(r-l+1 < 10){
                la = fixContributionRange(arr,l,r,la);
                
            }
            else{

                la  = removeContributionRange(arr,Math.max(l-1,1),Math.min(l+1,n),la);
                la  = removeContributionRange(arr,Math.max(r-1,1),Math.min(r+1,n),la);
                long temp = arr[l];
                arr[l] = arr[r];
                arr[r] = temp;


                la  = addContributionRange(arr,Math.max(l-1,1),Math.min(l+1,n),la);
                la  = addContributionRange(arr,Math.max(r-1,1),Math.min(r+1,n),la);


            }

            pn(la);
            ans = la ;

            // if(isHigh(r,arr)){
            //     la -= arr[r];
            // }
            // if(isLow(r,arr) && r < n){
            //     la += arr[r];
            // }
            // la = removeContribution(arr,l,la);
            // la = removeContribution(arr,r,la);


            // long temp = arr[l];
            // arr[l] = arr[r];
            // arr[r] = temp;


            // if(isHigh(l,arr)) la+=arr[l];

            // if(isLow(l,arr) && l < n) la-=arr[l];

            // if(isHigh(r,arr) && l != r ) la+=arr[r];

            // if(isLow(r,arr) && r < n && l != r) la-=arr[r];

            // pn(la);
            
        


            
        }
    }

}
long fixContributionRange(long[] arr,int l ,int r,long la){
    
    la = removeContributionRange(arr,Math.max(l-1,1),Math.min(r+1,n),la);
  //  pn("after removing contr "+la);
    long temp = arr[l];
    arr[l] = arr[r];
    arr[r] = temp;

  la = addContributionRange(arr,Math.max(l-1,1),Math.min(r+1,n),la);

    return la ;
}
long removeContributionRange(long[] arr, int l,int r,long la){

    for(int i= l;i<=r;++i){
        la = removeContribution(arr,i,la);
    }
    return la ;
}
long addContributionRange(long[] arr, int l,int r,long la){

    for(int i= l;i<=r;++i){
        la= addContribution(arr,i,la);
    }
    return la ;
}
long addContribution(long[] arr,int ind ,long la){
    
    if(isHigh(ind,arr)){
        la += arr[ind];
    }
    if(isLow(ind,arr) && ind < n){
        la -= arr[ind];
    }

    return la;
}

long removeContribution(long[] arr,int ind ,long la){
    
    if(isHigh(ind,arr)){
        la -= arr[ind];
    }
    if(isLow(ind,arr) && ind < n){
        la += arr[ind];
    }



    return la;
}

boolean isHigh(int ind,long[] arr){
    return (arr[ind] > arr[ind-1] && arr[ind] > arr[ind+1]);
}

boolean isLow(int ind,long[] arr){
    return (arr[ind] < arr[ind-1] && arr[ind] < arr[ind+1]);
}
long pow(long a, long b) {
    long result = 1;
    while (b > 0) {
        if (b % 2 == 1) result = (result * a) % mod;
        b /= 2;
        a = (a * a) % mod;
    }
    return result;
}
long gcd(long a, long b) {
    if (b == 0)
        return a;
    return gcd(b, a % b);
}
void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
 
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        //System.err.println(System.currentTimeMillis() - s + "ms");
}
public static void main(String[] args) throws Exception {
    //new Main().run();
    boolean memory = false ;
    if(memory) new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();System.exit(1);}}}, "1", 1 << 28).start();
    else new Main().run();
}
 
//output methods
private void dbg(Object... o){ System.err.println(Arrays.deepToString(o));}
void p(Object... o){for(Object oo:o)out.print(oo+" ");}
void pn(Object... o){for(int i = 0; i< o.length; i++)out.print(o[i]+(i+1 < o.length?" ":"\n"));}
void pni(Object... o){for(Object oo:o)out.print(oo+" ");out.println();out.flush();}
 
//input methods

private int[][] ng(int n, int e, int[] from, int[] to, boolean f){
    int[][] g = new int[n+1][];int[]cnt = new int[n+1];
    for(int i = 0; i< e; i++){
        cnt[from[i]]++;
        if(f)cnt[to[i]]++;
    }
    for(int i = 0; i<= n; i++)g[i] = new int[cnt[i]];
    for(int i = 0; i< e; i++){
        g[from[i]][--cnt[from[i]]] = to[i];
        if(f)g[to[i]][--cnt[to[i]]] = from[i];
    }
    return g;
}
private int[][][] nwg(int n, int e, int[] from, int[] to, boolean f){
    int[][][] g = new int[n+1][][];int[]cnt = new int[n+1];
    for(int i = 0; i< e; i++){
        cnt[from[i]]++;
        if(f)cnt[to[i]]++;
    }
    for(int i = 0; i<= n; i++)g[i] = new int[cnt[i]][];
    for(int i = 0; i< e; i++){
        g[from[i]][--cnt[from[i]]] = new int[]{to[i], i, 0};
        if(f) g[to[i]][--cnt[to[i]]] = new int[]{from[i], i, 1};
    }
    return g;
}


private byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
 
 
private int readByte() {
    if (lenbuf == -1) throw new InputMismatchException();
    if (ptrbuf >= lenbuf) {
        ptrbuf = 0;
        try {
            lenbuf = is.read(inbuf);
        } catch (IOException e) {
            throw new InputMismatchException();
        }
        if (lenbuf <= 0) return -1;
    }
    return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) {
    return !(c >= 33 && c <= 126);
}
private int skip() {
    int b;
    while ((b = readByte()) != -1 && isSpaceChar(b));
    return b;
}
 
private double nd() {
    return Double.parseDouble(ns());
}
private char nc() {
    return (char) skip();
}
 
private String ns() {
    int b = skip();
    StringBuilder sb = new StringBuilder();
    while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
        sb.appendCodePoint(b);
        b = readByte();
    }
    return sb.toString();
}
 
private char[] ns(int n) {
    char[] buf = new char[n];
    int b = skip(), p = 0;
    while (p < n && !(isSpaceChar(b))) {
        buf[p++] = (char) b;
        b = readByte();
    }
    return n == p ? buf : Arrays.copyOf(buf, p);
}
 
private char[][] nm(int n, int m) {
    char[][] map = new char[n][];
    for (int i = 0; i < n; i++) map[i] = ns(m);
    return map;
}
 
private int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++) a[i] = ni();
    return a;
}
 
private int ni() {
    int num = 0, b;
    boolean minus = false;
    while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
    if (b == '-') {
        minus = true;
        b = readByte();
    }
 
    while (true) {
        if (b >= '0' && b <= '9') {
            num = num * 10 + (b - '0');
        } else {
            return minus ? -num : num;
        }
        b = readByte();
    }
}
 
private long nl() {
    long num = 0;
    int b;
    boolean minus = false;
    while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
    if (b == '-') {
        minus = true;
        b = readByte();
    }
 
    while (true) {
        if (b >= '0' && b <= '9') {
            num = num * 10 + (b - '0');
        } else {
            return minus ? -num : num;
        }
        b = readByte();
    }
}

}