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

public class First {

	public static void main(String[] args) throws Exception {

//		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
//		int t = Integer.parseInt(br.readLine());
//		while (t-- > 0) {
//			int n = Integer.parseInt(br.readLine());
//			String[] str = (br.readLine()).trim().split(" ");
//			int[] arr = new int[n];
//			for (int i = 0; i < n; i++) {
//				arr[i] = Integer.parseInt(str[i]);
//			}
//		}
//		return;

//		first();
//		sec();
		third();
//		four();
//		fif();
//		six();
	}

	private static void third() throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		while (t-- > 0) {
			String[] str = (br.readLine()).trim().split(" ");
			int n = Integer.parseInt(str[0]);
			str = (br.readLine()).trim().split(" ");
			int[] arr = new int[n];
			long sum = 0;
			int prev = 0;
			int par = 0;
			for (int i = 0; i < n; i++) {
				arr[i] = Integer.parseInt(str[i]);
				if (par % 2 == 0) {
					if (arr[i] > prev) {
						prev = arr[i];
					} else {
						sum += prev;
						par = 1;
						prev = arr[i];
					}
				} else {
					if (arr[i] < prev) {
						prev = arr[i];
					} else {
						par = 0;
						sum -= prev;
						prev = arr[i];
					}
				}
			}
			if (par == 0) {
				sum += prev;
			}
			System.out.println(sum);
		}
	}

	private static void sec() throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		while (t-- > 0) {
			int n = Integer.parseInt(br.readLine());
			String[] str = (br.readLine()).trim().split(" ");
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = Integer.parseInt(str[i]);
			}
			HashMap<Integer, Integer> map = new HashMap<>();

			long count = 0;
			for (int i = 0; i < n; i++) {
				int dig = (int) (Math.log(arr[i]) / Math.log(2)) + 1;
				int mask = (int) (arr[i] >> (dig - 1));
				if ((mask & 1) == 1) {

					if (map.containsKey(dig)) {
						map.put(dig, map.get(dig) + 1);
					} else {
						map.put(dig, 1);
					}

				}
			}
			for (int i : map.keySet()) {
				long freq = map.get(i);
				count += (freq) * (freq - 1) / 2;
			}

			System.out.println(count);
		}
	}

	private static void first() throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		while (t-- > 0) {
			int n = Integer.parseInt(br.readLine());
			String[] str = (br.readLine()).trim().split(" ");
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = Integer.parseInt(str[i]);
			}
			long count = countSwaps(arr, n);
//			System.out.println(count);
			long req = (((long) n * (n - 1)) / 2) - 1;
			if (count <= req) {
				System.out.println("YES");
			} else {
				System.out.println("NO");
			}
//			System.out.println(req);
		}
	}

	static long merge(long arr[], long temp[], int left, int mid, int right) {
		long inv_count = 0;
		int i = left;
		int j = mid;
		int k = left;
		while ((i <= mid - 1) && (j <= right)) {
			if (arr[i] <= arr[j])
				temp[k++] = arr[i++];
			else {
				temp[k++] = arr[j++];
				inv_count = inv_count + (mid - i);
			}
		}

		while (i <= mid - 1)
			temp[k++] = arr[i++];

		while (j <= right)
			temp[k++] = arr[j++];
		for (i = left; i <= right; i++)
			arr[i] = temp[i];

		return inv_count;
	}

	static long _mergeSort(long arr[], long temp[], int left, int right) {
		int mid = 0;
		long inv_count = 0;
		if (right > left) {
			mid = (right + left) / 2;

			inv_count = _mergeSort(arr, temp, left, mid);

			inv_count += _mergeSort(arr, temp, mid + 1, right);

			inv_count += merge(arr, temp, left, mid + 1, right);
		}

		return inv_count;
	}

	static long countSwaps(long arr[], int n) {
		long temp[] = new long[n];
		return _mergeSort(arr, temp, 0, n - 1);
	}
}