// Author: Shawn Das Shachin-->(shawn_das)

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define mod 1000000007
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define OPTIMIZE_IO ios::sync_with_stdio(false); cin.tie(nullptr);

void solve(){
    int n,k;
    cin>>n>>k;
    string str;
    cin>>str;

    int max_count = 0, count = 0;
    vector<int> counts;
    for (auto it : str) {
        if (it == '1') {
            count++;
            max_count = max(max_count, count);
        } else {
            counts.push_back(count);
            count = 0;
        }
    }
    counts.push_back(count);
    rsrt(counts);
    ll ans=0;
    for(int i=0; i<k+1; i++){
        ans+=counts[i];
    }
    cout<<ans<<endl;
}
int main() {
    OPTIMIZE_IO;
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}