#include <bits/stdc++.h>

using namespace std;

int t, n, m;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    cin >> t;
    while(t--) {
        cin >> n;
        vector<int> pancake(n, 0);
        for(int i = 0; i < n; i++) {
            cin >> m;
            if(!m)
                continue;
            if(i - (m - 1) >= 0)
                pancake[i - (m - 1)] = max(pancake[i - (m - 1)], m);
            else
                pancake[0] = max(pancake[0], i + 1);
        }
        int prev = 0;
        for(int i = 0; i < n; i++) {
            if(prev)
                prev--;
            prev = max(prev, pancake[i]);
            cout << (prev ? 1 : 0) << " ";
        }
        cout << "\n";
    }

    return 0;
}