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.util.*;
import java.io.*;

public class CFC {
  BufferedReader br;
  PrintWriter out;
  StringTokenizer st;
  boolean eof;
  private static final long MOD = 1000L * 1000L * 1000L + 7;
  private static final int[] dx = {0, -1, 0, 1};
  private static final int[] dy = {1, 0, -1, 0};
  private static final String yes = "Yes";
  private static final String no = "No";

  void solve() {
    int T = nextInt();
    for (int i = 0; i < T; i++) {
      helper();
    }
  }

  int n;
  int[] arr;
  SegtreeNode[] tree;
  class SegtreeNode {
    long maxPosPos;
    long maxPosNeg;
    long maxNegPos;
    long maxNegNeg;
    public SegtreeNode() {
      maxPosPos = Long.MIN_VALUE;
      maxPosNeg = Long.MIN_VALUE;
      maxNegPos = Long.MIN_VALUE;
      maxNegNeg = Long.MIN_VALUE;
    }

    @Override
    public String toString() {
      return "(" + maxPosPos + " " + maxPosNeg + " " + maxNegPos + " " + maxNegNeg + ")";
    }
  }

  void helper() {
    n = nextInt();
    int q = nextInt();
    arr = nextIntArr(n);
    tree = new SegtreeNode[4 * arr.length];
    for (int i = 0; i < tree.length; i++) {
      tree[i] = new SegtreeNode();
    }

    build_tree(1, 0, n - 1);
    outln(query_tree());

    for (int i = 0; i < q; i++) {
      int start = nextInt() - 1;
      int end = nextInt() - 1;
      int vStart = arr[start];
      int vEnd = arr[end];
      update_tree(1, 0, n - 1, start, vEnd);
      update_tree(1, 0, n - 1, end, vStart);
      arr[start] = vEnd;
      arr[end] = vStart;
      outln(query_tree());
    }
  }

  SegtreeNode combine(int node, SegtreeNode left, SegtreeNode right) {
    SegtreeNode res = tree[node];
    res.maxPosPos = Math.max(left.maxPosPos, right.maxPosPos);
    res.maxPosNeg = Math.max(left.maxPosNeg, right.maxPosNeg);
    res.maxNegPos = Math.max(left.maxNegPos, right.maxNegPos);
    res.maxNegNeg = Math.max(left.maxNegNeg, right.maxNegNeg);
    if (left.maxPosPos != Long.MIN_VALUE && right.maxNegPos != Long.MIN_VALUE) {
      res.maxPosPos = Math.max(res.maxPosPos, left.maxPosPos + right.maxNegPos);
    }
    if (left.maxPosPos != Long.MIN_VALUE && right.maxNegNeg != Long.MIN_VALUE) {
      res.maxPosNeg = Math.max(res.maxPosNeg, left.maxPosPos + right.maxNegNeg);
    }
    if (left.maxPosNeg != Long.MIN_VALUE && right.maxPosPos != Long.MIN_VALUE) {
      res.maxPosPos = Math.max(res.maxPosPos, left.maxPosNeg + right.maxPosPos);
    }
    if (left.maxPosNeg != Long.MIN_VALUE && right.maxPosNeg != Long.MIN_VALUE) {
      res.maxPosNeg = Math.max(res.maxPosNeg, left.maxPosNeg + right.maxPosNeg);
    }

    if (left.maxNegPos != Long.MIN_VALUE && right.maxNegPos != Long.MIN_VALUE) {
      res.maxNegPos = Math.max(res.maxNegPos, left.maxNegPos + right.maxNegPos);
    }
    if (left.maxNegPos != Long.MIN_VALUE && right.maxNegNeg != Long.MIN_VALUE) {
      res.maxNegNeg = Math.max(res.maxNegNeg, left.maxNegPos + right.maxNegNeg);
    }
    if (left.maxNegNeg != Long.MIN_VALUE && right.maxPosPos != Long.MIN_VALUE) {
      res.maxNegPos = Math.max(res.maxNegPos, left.maxNegNeg + right.maxPosPos);
    }
    if (left.maxNegNeg != Long.MIN_VALUE && right.maxPosNeg != Long.MIN_VALUE) {
      res.maxNegNeg = Math.max(res.maxNegNeg, left.maxNegNeg + right.maxPosNeg);
    }
    return res;
  }

  void build_tree(int node, int startIndex, int endIndex) {
    if(startIndex > endIndex) return; // Out of range
    if(startIndex == endIndex) { // Leaf node
      tree[node].maxPosPos = arr[startIndex];
      tree[node].maxNegNeg = -arr[startIndex];
      return;
    }

    build_tree(node * 2, startIndex, (startIndex + endIndex) / 2); // Init left child
    build_tree(node * 2 + 1, 1 + (startIndex + endIndex) / 2, endIndex); // Init right child
    tree[node] = combine(node, tree[node * 2], tree[node * 2 + 1]); // Init root value
  }

  /**
   * Increment elements at queryIndex with value
   */
  void update_tree(int node, int nodeStartIndex, int nodeEndIndex, int queryIndex, int absVal) {
    if(nodeStartIndex > nodeEndIndex || nodeStartIndex > queryIndex || nodeEndIndex < queryIndex) // Current segment is not within range [i, j]
      return;
    if(nodeStartIndex == nodeEndIndex) { // Segment is fully within range
      tree[node].maxPosPos = absVal;
      tree[node].maxNegNeg = -absVal;
      return;
    }

    update_tree(node * 2, nodeStartIndex, (nodeStartIndex + nodeEndIndex) / 2, queryIndex, absVal); // Updating left child
    update_tree(node * 2 + 1, 1 + (nodeStartIndex + nodeEndIndex) / 2, nodeEndIndex, queryIndex, absVal); // Updating right child

    tree[node] = combine(node, tree[node * 2], tree[node * 2 + 1]); // Updating root
  }

  /**
   * Query tree to get max element value within range [queryStartIndex, queryEndIndex]
   */
  long query_tree() {
    return Math.max(tree[1].maxPosPos, tree[1].maxPosNeg);
  }

  void shuffle(long[] a) {
    int n = a.length;
    for(int i = 0; i < n; i++) {
      int r = i + (int) (Math.random() * (n - i));
      long tmp = a[i];
      a[i] = a[r];
      a[r] = tmp;
    }
  }
  long gcd(long a, long b) {
    while(a != 0 && b != 0) {
      long c = b;
      b = a % b;
      a = c;
    }
    return a + b;
  }
  private void outln(Object o) {
    out.println(o);
  }
  private void out(Object o) {
    out.print(o);
  }
  private void formatPrint(double val) {
    outln(String.format("%.9f%n", val));
  }
  public CFC() {
    br = new BufferedReader(new InputStreamReader(System.in));
    out = new PrintWriter(System.out);
    solve();
    out.close();
  }
  public static void main(String[] args) {
    new CFC();
  }

  public long[] nextLongArr(int n) {
    long[] res = new long[n];
    for(int i = 0; i < n; i++)
      res[i] = nextLong();
    return res;
  }
  public int[] nextIntArr(int n) {
    int[] res = new int[n];
    for(int i = 0; i < n; i++)
      res[i] = nextInt();
    return res;
  }
  public String nextToken() {
    while (st == null || !st.hasMoreTokens()) {
      try {
        st = new StringTokenizer(br.readLine());
      } catch (Exception e) {
        eof = true;
        return null;
      }
    }
    return st.nextToken();
  }
  public String nextString() {
    try {
      return br.readLine();
    } catch (IOException e) {
      eof = true;
      return null;
    }
  }
  public int nextInt() {
    return Integer.parseInt(nextToken());
  }
  public long nextLong() {
    return Long.parseLong(nextToken());
  }
  public double nextDouble() {
    return Double.parseDouble(nextToken());
  }
}