#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
void solve() {
//dharmil here
int x,y,n;
cin>>x>>y>>n;
int a[n+1];
for(int i=1;i<=n;i++) cin>>a[i];
int p[n+1];
for(int i=1;i<=n;i++){
if(i - y >=1){
p[i] = a[i] + p[i-y];
}else{
p[i] = a[i];
}
}
int ans = INT_MAX;
for(int i=1;i<=n;i++){
int in = i - (x-1)*y;
int g = p[i];
if(in>=1){
if(in -y >=1){
g = g - p[in-y];
}
ans = min(ans,g);
}
}
cout << ans << endl;
}
int main() {
fastio;
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGZhc3RpbyBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsgY2luLnRpZSgwKTsgY291dC50aWUoMCk7CiNkZWZpbmUgbGwgbG9uZyBsb25nCnZvaWQgc29sdmUoKSB7CiAgICAvL2RoYXJtaWwgaGVyZQogICAgaW50IHgseSxuOwogICAgY2luPj54Pj55Pj5uOwoKICAgIGludCBhW24rMV07CiAgICBmb3IoaW50IGk9MTtpPD1uO2krKykgY2luPj5hW2ldOwoKICAgIGludCBwW24rMV07CgogICAgZm9yKGludCBpPTE7aTw9bjtpKyspewogICAgICAgIGlmKGkgLSB5ID49MSl7CiAgICAgICAgICAgcFtpXSA9IGFbaV0gKyBwW2kteV07CiAgICAgICAgfWVsc2V7CiAgICAgICAgICAgIHBbaV0gPSBhW2ldOwogICAgICAgIH0KICAgIH0KICAgIGludCBhbnMgPSBJTlRfTUFYOwogICAgZm9yKGludCBpPTE7aTw9bjtpKyspewogICAgICAgIGludCBpbiA9IGkgLSAoeC0xKSp5OwogICAgICAgIGludCBnID0gcFtpXTsKICAgICAgICBpZihpbj49MSl7CiAgICAgICAgICAgIGlmKGluIC15ID49MSl7CiAgICAgICAgICAgICAgICBnID0gZyAtIHBbaW4teV07CiAgICAgICAgICAgIH0KICAgICAgICAgICAgYW5zICA9IG1pbihhbnMsZyk7CiAgICAgICAgfQogICAgfQogICAgY291dCA8PCBhbnMgPDwgZW5kbDsKfQoKaW50IG1haW4oKSB7CiAgICBmYXN0aW87CiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgewogICAgICAgIHNvbHZlKCk7CiAgICB9CiAgICByZXR1cm4gMDsKfQ==