#include <bits/stdc++.h>using namespace std;const int N=1005;void sort(int *x, int *y, int *sa, int n, int m) {	static int c[N], i;	for(i=0; i<m; ++i) c[i]=0;	for(i=0; i<n; ++i) ++c[x[y[i]]];	for(i=1; i<m; ++i) c[i]+=c[i-1];	for(i=n-1; i>=0; --i) sa[--c[x[y[i]]]]=y[i];}void hz(int *a, int *sa, int n, int m) {	static int t1[N], t2[N], i, j, p, *x, *y, *t;	x=t1, y=t2;	for(i=0; i<n; ++i) x[i]=a[i], y[i]=i;	sort(x, y, sa, n, m);	for(j=1, p=1; p<n; j<<=1, m=p) {		p=0;		for(i=n-j; i<n; ++i) y[p++]=i;		for(i=0; i<n; ++i) if(sa[i]-j>=0) y[p++]=sa[i]-j;		sort(x, y, sa, n, m);		for(t=x, x=y, y=t, p=1, x[sa[0]]=0, i=1; i<n; ++i)			x[sa[i]]=y[sa[i]]==y[sa[i-1]]&&y[sa[i]+j]==y[sa[i-1]+j]?p-1:p++;	}}void geth(int *s, int *sa, int *h, int n) {	static int rank[N], j, i, k;	for(i=1; i<=n; ++i) rank[sa[i]]=i;	for(k=0, i=1; i<=n; h[rank[i++]]=k)		for(k?--k:0, j=sa[rank[i]-1]; s[i+k]==s[j+k]; ++k);}int a[N], sa[N], h[N], n;char s[N];int main() {	int cs;	scanf("%d", &cs);	while(cs--) {		scanf("%s", s+1);		n=strlen(s+1);		for(int i=1; i<=n; ++i) a[i]=s[i];		hz(a, sa, n+1, 128);		geth(a, sa, h, n);		int ans=0;		for(int i=1; i<=n; ++i) ans+=n-sa[i]+1-h[i];		printf("%d\n", ans);	}	return 0;}