#include <bits/stdc++.h>
using namespace std;

const int INF = 1000000000;
int a[20002], dp[20002][2002];

void solve() {
	int n, m; cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}

	for (int i = 0; i < m; i++) {
		dp[0][i] = 0;
	}
	
	int ans = INF;
	for (int i = 1; i <= n+1; i++) {
		for (int j = 1; j < m; j++) {
			dp[i][j] = INF;
		}

		for (int j = 1; j < m; j++) {
			if (j > i) break;
			dp[i][j] = min(dp[i][j], dp[i-j][m-j] + a[i]);
		}

		for (int j = 2; j < m; j++) {
			dp[i][j] = min(dp[i][j], dp[i][j-1]);
		}

		/*for (int j = 1; j < m; j++) {
			cout << dp[i][j] << ' ';
		}
		cout << '\n';*/

		if (i == n+1) {
			for (int j = 1; j < m; j++) {
				ans = min(ans, dp[i][j]);
			}
		}
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int ts; cin >> ts;
	while (ts--) {
		solve();
	} 

	return 0;
}