#include<bits/stdc++.h>
using namespace std;
const int inf=0x3f3f3f3f;
struct YT
{
	map<int,long long> mp[7]; //mp[a]=pos: consecutive a's starting at pos
	YT()
	{
		for(int r=1;r<=5;r++)
			mp[r][inf]=0;
	}
	void insert(int r,int val,int cnt)
	{
		if(r>5)return;
		auto it=mp[r].upper_bound(val);
		long long pos=it->second;
		if(not mp[r].contains(val))mp[r][val]=pos;
		while(1)
		{
//			cerr<<"insert "<<r<<' '<<val<<' '<<cnt<<' ';
//			if(it!=mp[r].end())cerr<<' '<<it->first<<' '<<it->second<<endl;
//			else {cerr<<"fuck "<<endl;assert(0);}
			if(it->first==inf)
			{
				it->second=pos+cnt;
				return;
			}
			if(it->second<=pos+cnt)
			{
				if(next(it)->second<=pos+cnt)
				{
					insert(r+1,it->first,next(it)->second-it->second);
					it=mp[r].erase(it);
				}
				else
				{
					if(it->second!=pos+cnt)insert(r+1,it->first,pos+cnt-it->second);
					it->second=pos+cnt;
					return;
				}
			}
		}
	}
	long long query()
	{
		long long ret=0;
		for(int r=1;r<=5;r++)
			ret+=mp[r][inf];
		return ret;
	}
};
int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		YT t;
		int n;
		cin>>n;
		for(int i=1;i<=n;i++)
		{
			int x;
			cin>>x;
			t.insert(1,x,x);
			cout<<t.query()<<" \n"[i==n];
		}
		if(T%10==0)cout<<flush;
	}
	
	return 0;
}