/*
  Beautiful Codes are MUCH better than 'Shorter' ones !
user  : triveni
date  : 28/02/2018
time  : 16:27:29
*/
#include <bits/stdc++.h>

using namespace std;

#define      pii               std::pair<int,int>
#define      vi                std::vector<int>
#define      sz(v)             (int)(v.size())
#define      mp(a,b)           make_pair(a,b)
#define      pb(a)             push_back(a)
#define      each(it,s)        for(auto it = s.begin(); it != s.end(); ++it)
#define      rep(i, n)         for(int i = 0; i < (n); ++i)
#define      all(v)            v.begin(), v.end()
#define      scan(n)           scanf("%d", &n)
#define      scan2(n, m)       scanf("%d%d", &n, &m)
#define      pin(n)            printf("%d\n",n)
#define      pis(n)            printf("%d ",n)
#define      pll(n)            printf("%lld\n", n)
#define      X                 first
#define      Y                 second

typedef long long ll;
ll mod = 1000000007;

inline int pow_(ll a, int n, int p=mod){
int r=1;while(n){if(n&1)r=r*a%p;n>>=1;a=a*a%p;}return r;}
inline int inv_(int a) {return pow_(a, mod-2, mod);}
inline int add(int a, int b){a+=b;if(a>=mod)a-=mod;return a;}
inline void adds(int& a, int b){a+=b;if(a>=mod)a-=mod;}
inline int mul(int a, int b){return a*1ll*b%mod;}
inline void muls(int& a, int b){a=a*1ll*b%mod;}
inline int sub(int a, int b){a-=b;if(a<0)a+=mod;return a;}

int inp[100100];

int bit[100100];
int n;

void update(int idx, int val) {
	bit[idx+1] += val;
}

int main()
{
	int T;
	scan(T);
	while(T--) {
		scan(n);
		rep(i, n) scan(inp[i]);
		memset(bit, 0, (n+10)<<2);
		rep(i, n) {
			int j = i, sum = 0;
			while(j >= 0 && sum <= inp[i]) sum += inp[--j];
			update(j, 1); update(i, -1);
			j = i, sum = 0;
			while(j < n && sum <= inp[i]) sum += inp[++j];
			update(i+1, 1); update(j+1, -1);
		}
		rep(i, n) bit[i+1] += bit[i];
		rep(i, n) pis(bit[i+1]);
		putchar(10);
	}
	return 0;
}