#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
const int dx[]{-1,+1,+0,+0,-1,-1,+1,+1};
const int dy[]{+0,+0,+1,-1,-1,+1,-1,+1};
const int MOD = 1e9+7;
#define ll long long
#define int ll
#define ld long double
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
ordered_set;


const int N = 4e6+1;

void solve(int testCase){
    int n, k;
    cin >> n >> k;
    std::vector<int> v(n);
    for(int& x : v) cin >> x;
    vector<int> ans(n); int p = 0;
    for(int i = 0; i < n; ++i){
        if(v[i] > 0){
            ans[i] = p;
            if(++p == k) p = 0;
        } else {
            if(--p < 0) p += k;
            ans[i] = p;
        }
    }    
    for(int i = 0; i < n; ++i) cout << ans[i]+1 << " ";
    cout << '\n';
}

int32_t main(){
    fastio();  
    int t = 1;
    cin >> t;     
    for(int i = 1; i <= t; ++i){
        solve(i);
    }
    return 0;
}