#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
#define sz(x) (ll)(x).size()
#define rd ({ll x; cin >> x; x; })
#define dbg(x) cerr << "[" #x "]  " << (x) << "\n\n"
// #define errv(x) {cerr << "["#x"]  ["; for (const auto& ___ : (x)) cerr << ___ << ", "; cerr << "]\n";}
// #define errvn(x, n) {cerr << "["#x"]  ["; for (auto ___ = 0; ___ < (n); ++___) cerr << (x)[___] << ", "; cerr << "]\n";}
// #define cerr if(0)cerr
#define xx first
#define yy second
mt19937 rnd(std::chrono::high_resolution_clock::now().time_since_epoch().count());
/*_________________________________________________________________________________________________________________________*/

void Solve()
{
    ll n;
    cin >> n;
    vector<ll> arr(n);
    for (int i = 0; i < n; i++)
        cin >> arr[i];
    vector<pair<vector<ll>, ll>> fTree(n, { {}, -1 });
    vector<bool> vis(n, false);
    ll base = 0;
    for (int i = 0; i < n; i++) {
        ll nextIndex = i + arr[i];
        if (nextIndex < n) {
            fTree[nextIndex].xx.push_back(i);
            vis[nextIndex] = true;
            fTree[i].yy = nextIndex;
        }
        if (!vis[i]) {
            vis[i] = true;
            base++;
        }
    }
    // dbg(base);
    for (int i = 0; i < n; i++) {
        ll nextIndex = i + arr[i];
        if (nextIndex < n) {
            if (sz(fTree[nextIndex].xx) == 1) {
                cout << base + 1 << ' ';
                continue;
            }
        }
        cout << base << ' ';
    }
    cout << "\n";
}

int32_t main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        // cout << "Case #" << i << ": "; // cout << "Case " << i << ": ";
        Solve();
    }
    return 0;
}
// Coded by Tahsin Arafat (@TahsinArafat)