#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(n)  n.begin(),n.end()
#define sz(n) (ll) n.size()
#define endl '\n'
const ll mod = 1e9 + 7;

void test_case() {
    ll n;
    cin >> n;
    vector<ll> v(n);
    for (ll i=0; i<n; i++) cin >> v[i];
    for (ll i=0; i<n; i++) {
        ll cnt = 0;
        vector<ll> light(n,0);
        for (ll j=0; j<n; j++) {
            if ((j == i) and (j == 0)) {
                cnt++;
                continue;
            }
            if (light[j] == 0) {
                cnt++;
                if ((j + v[j]) < n) light[j + v[j]] = 1;
            }
            if ((light[j] == 1) and (j != i)){
                if (j + v[j] < n) light[j + v[j]] = 1;
            }
        }
        cout << cnt << ' ';
    }
    cout << endl;
}

int32_t main() {
    //freopen("input.txt","r", stdin);
    //freopen("output.txt","w", stdout);
    //cout << fixed << setprecision(6);
    //priority_queue<ll,vector<ll>,greater<ll>> minH;
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
    cin >> t;
    while(t--) {
        test_case();
    }
}