//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
mt19937_64 rnd(time(0));
const ll mod=998244353,base=rnd()%1000+400;
ll H[100100];
ll pw[100100];
ll get(int l,int r)
{
	return (H[r]-H[l-1]*pw[r-l+1]%mod+mod)%mod;
}
int n;
int bit[100100];
void update(int p,int v)
{
	while(p<=n)
	{
		bit[p]=min(bit[p],v);
		p+=(p&(-p));
	}
}
int query(int p)
{
	int ans=inf;
	while(p)
	{
		ans=min(ans,bit[p]);
		p-=(p&(-p));
	}
	return ans;
}
int ind[100100];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	pw[0]=1;
	for(int i=1;i<100100;i++)
		pw[i]=pw[i-1]*base%mod;
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n;
		string s;
		cin>>s;
		for(int i=1;i<=n;i++)
			bit[i]=n+1;
		for(int i=0;i<n;i++)
			H[i+1]=(H[i]*base+s[i])%mod;
		vector<int> vec;
		for(int i=1;i<=n;i++)
			vec.pb(i);
		sort(ALL(vec),[&](int a,int b)
		{
			int len=n-max(a,b)+1;
			int l=0,r=len;
			while(l<r)
			{
				int mid=(l+r+1)/2;
				if(get(a,a+mid-1)==get(b,b+mid-1))
					l=mid;
				else
					r=mid-1;
			}
			if(l==len)
				return a>b;
			return s[a+l-1]<s[b+l-1];
		});
		for(int i=1;i<=n;i++)
			ind[vec[i-1]]=i;
		vector<int> ans;
		for(int i=n;i>=1;i--)
		{
			ans.pb(query(ind[i])-i);
			update(ind[i],i);
		}
		rev(ans);
		for(auto x:ans)
			cout<<x<<" ";
		cout<<'\n';
	}
	return 0;
}