#include <bits/stdc++.h>
using namespace std;
priority_queue<long long> pq;
using vec = vector<long long>;
using mapa = map<long long, long long>;
long long fact(long long n) {
  long long ans = 1;
  for (long long i = 1; i <= n; i++) ans *= i;
  return ans;
}
long long glcm(vector<long long> &T) {
  long long size = T.size();
  map<long long, long long> mpi, mpf;
  for (long long i = 0; i < size; i++) {
    long long n = T[i];
    mpi.clear();
    for (long long j = 2; j * j <= n; j++) {
      while (n % j == 0) {
        mpi[j]++;
        mpf[j] = max(mpf[j], mpi[j]);
        n /= j;
      }
    }
    if (n > 1) mpi[n]++;
    mpf[n] = max(mpf[n], mpi[n]);
  }
  auto it = mpf.begin();
  long long ans = 1;
  while (it != mpf.end()) {
    long long u = (it->first), v = (it->second);
    long long p = pow(u, v);
    ans *= p;
    it++;
  }
  return ans;
}
bool cbit(long long n, long long pos) { return (n & (1 << pos)); }
int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long i, j, k, l, m, n, t, p, x, r, q, y;
  cin >> t;
  while (t--) {
    cin >> n >> q;
    long long a[n], flag = -1;
    for (i = 0; i < n; i++) cin >> a[i];
    stack<long long> st;
    vec vi;
    st.push(a[0]);
    for (i = 1; i < n; i++) {
      long long u = st.top();
      if (flag == -1) {
        if (a[i] > u)
          st.pop(), st.push(a[i]);
        else
          st.push(a[i]), flag *= (-1);
      } else {
        if (a[i] < u)
          st.pop(), st.push(a[i]);
        else
          st.push(a[i]), flag *= (-1);
      }
    }
    while (!st.empty()) {
      vi.push_back(st.top());
      st.pop();
    }
    reverse(vi.begin(), vi.end());
    m = *max_element(a, a + n);
    p = 0;
    for (i = 0; i < vi.size(); i++) {
      if (i % 2 == 0)
        p += vi[i];
      else
        p -= vi[i];
      m = max(m, p);
    }
    cout << m << endl;
  }
  return 0;
}
