#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef complex<ld> co;
const ld PI=atan2((ld)0, (ld)-1);
void fft(vector<co>&a, int n, int k) {
vector<co> ww(n+1);
ww[1]=co(1, 0);
for (int t=0;t<k-1;t++) {
co c=polar((ld)1, PI/n*(1<<(k-1-t)));
int p2=(1<<t),p3=p2*2;
for (int j=p2;j<p3;j++) ww[j*2+1]=(ww[j*2]=ww[j])*c;
}
for (int i=0;i<n;i++) {
int u=0;
for (int j=1;j<n;j*=2) {u*=2;if (i&j) u++;}
if (i<u) swap(a[i], a[u]);
}
for (int l=1;l<n;l*=2) {
for (int i=0;i<n;i+=l) {
for (int it=0,j=i+l,w=l;it<l;it++,i++,j++) {
co t=a[j]*ww[w++];
a[j]=a[i]-t;
a[i]=a[i]+t;
}
}
}
}
vector<ll> conv(const vector<ll>& a, const vector<ll>& b) {
int as=a.size(), bs=b.size();
if (as*bs==0) return {};
int k=0;
while ((1<<k)<as+bs-1) k++;
int n=1<<k;
vector<co> c(n+1);
for (int i=0;i<n;i++) {
if (i<as) c[i]=a[i];
if (i<bs) c[i]={c[i].real(), (ld)b[i]};
}
fft(c, n, k);
c[n]=c[0];
for (int i=0;i<=n-i;i++) {
c[i]=conj(c[i]*c[i]-conj(c[n-i]*c[n-i]))*co(0,(ld)1/n/4);
c[n-i]=conj(c[i]);
}
fft(c, n, k);
vector<ll> r(as+bs-1);
for (int i=0;i<as+bs-1;i++) r[i]=round(c[i].real());
return r;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int tt;
cin>>tt;
for(int xx = 0; xx < tt; ++xx) {
string s;
cin>>s;
int n = s.size();
vector<ll> w(n);
int zeroes = 0;
for(int i = 0; i < n; ++i) {
char q;
//cin>>q;
q = s[i];
w[i] = q-'0';
zeroes += (w[i] == 0);
}
/*
int ans2[100] = {0};
for(int i = 0; i < n; ++i) {
for(int j = i; j < n; ++j) {
int sum = 0;
for(int k = i; k <= j; ++k) {
sum += w[k];
}
ans2[sum]++;
}
}
for(int i = 0; i <= n; ++i) cout<<ans2[i]<<' ';
cout<<'\n';
*/
if(zeroes == n) {
cout<<(ll)n*(n+1)/2<<' ';
for(int i = 1; i <= n ;++i) {
cout<<0<<' ';
}
cout<<'\n';
continue;
}
int prev = -1;
vector<ll> v;
ll ans = 0;
for(int i = 0; i < n; ++i) {
if(w[i] == 1) {
v.push_back(i-prev);
ans+= ll(i-prev)*(i-prev-1)/2;
prev = i;
}
}
ans += ll(n-1-prev)*(n-prev)/2;
prev = n;
vector<ll> q;
for(int i = n-1; i >= 0; --i) {
if(w[i] == 1) {
q.push_back(prev-i);
prev = i;
}
}
reverse(v.begin(), v.end());
reverse(q.begin(), q.end());
/*
for(auto x: v) cout<<x<<' ';
cout<<'\n';
for(auto x: q) cout<<x<<' ';
cout<<'\n';
cout<<endl;
*/
auto c = conv(v, q);
int lol = 1;
// cout<<(ll)zeroes*(zeroes+1)/2<<' ';
cout<<ans<<' ';
for(int i = 0; i < q.size(); ++i) {
cout<<c[q.size()-1+i]<<' ';
++lol;
}
for(;lol <= n; ++lol) {
cout<<0<<' ';
}
cout<<'\n';
}
}
