/* 
 *   @author:- MAHMUDUL HASAN SAKIB
 *   DATE:-11/07/2024 ; TIME-2024-07-11 20:19:52 PM 
 *   BANGLADESH , SYLHET.
 */ 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define maxn 500005
#define mod 1000000007
#define inf 1000000007
#define pii pair<ll,ll>
#define vii vector<pii>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define lcm(a,b) ((a*b)/__gcd(a,b))
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i > (b); i--)
#define rev_str(str) reverse(str.begin(),str.end())
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

void solve() {
    ll n,m;cin>>n>>m;
    vi p(n);
    ll ki= n-m+1;
    rep(i,0,n) cin>>p[i];
    map<ll,ll> freq;
    ll count = 0;
    rep(i,0,(n-m+1)) {
        ll sum = 0;
        rep(j,0,m){
            sum += p[i+j];
        }
        freq[sum]++;
        count = max(count,freq[sum]);
    }
    cout<<ki-count<<endl;
}

int main() {
    auto begin = std::chrono::high_resolution_clock::now();
    fast
    ll t;cin >> t;
    while(t--) {
        solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}