#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int TID;
int N, M, C;
vector<int> A;

namespace brute {
/*
  yanhe : x[0],...,x[k]
  tianyi: y[N-1],...,y[k]
  s := \sum x[i]
  t := \sum y[i]
  fix t ~> x[0],...,x[k-1]: greedy
  fix s ~> y[N-1],...,y[k+1]: greedy
*/
int pre[4010][4010];
int suf[4010][4010];
int run() {
  for (int t = 0; t <= M; ++t) {
    pre[t][0] = 0;
    for (int i = 0; i < N; ++i) {
      const int x = (max(A[i] - pre[t][i] - t, 0) + (C+1) - 1) / (C+1);
      pre[t][i + 1] = pre[t][i] + x;
    }
  }
  for (int s = 0; s <= M; ++s) {
    suf[s][N] = 0;
    for (int i = N; --i >= 0; ) {
      const int y = (max(A[i] - s - suf[s][i + 1], 0) + (C+1) - 1) / (C+1);
      suf[s][i] = y + suf[s][i + 1];
    }
  }
  int ans = M;
  for (int i = 0; i < N; ++i) {
    /*
    for (int s = 0; s <= M; ++s) for (int t = 0; t <= M; ++t) {
      const int x = s - pre[t][i];
      const int y = t - suf[s][i + 1];
      if (x >= 0 && y >= 0 && C * (x + y) >= A[i] - s - t) {
        chmin(ans, s + t);
      }
    }
    */
    for (int s = 0; s <= M; ++s) {
      int lo = -1, hi = M + 1;
      for (; lo + 1 < hi; ) {
        const int t = (lo + hi) / 2;
        const int x = s - pre[t][i];
        const int y = t - suf[s][i + 1];
        ((x >= 0 && y >= 0 && C * (x + y) >= A[i] - s - t) ? hi : lo) = t;
      }
      chmin(ans, s + hi);
    }
  }
  return ans;
}
}  // brute

int sub2() {
  int ans = *max_element(A.begin(), A.end());
  for (int i = 0; i < N; ++i) if (A[i] >= 2) {
    int l = 0, r = 0;
    for (int j = 0; j < i; ++j) chmax(l, A[j]);
    for (int j = i + 1; j < N; ++j) chmax(r, A[j]);
    if (l + r <= 1) chmin(ans, 1);
    break;
  }
  return ans;
}

int main() {
  for (int numCases; ~scanf("%d%d", &numCases, &TID); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d%d", &N, &M, &C);
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    
    int ans;
    if (C == 0) {
      ans = *max_element(A.begin(), A.end());
    } else if (M <= 2) {
      ans = sub2();
    } else {
      ans = brute::run();
    }
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}