int ans = 0;

if(x==y)return N-x;

for(int s = steps; s>=0 && x<N && y<N; s--){

if(P[s][x] == P[s][y]){

ans += (1<<s);

x += 1<<s;

y += 1<<s;

}

}

return ans;

for(int i=0; i<N; i++){

P[0][i] = S[i] - 'a';

}

for(int s=1, cnt=1; cnt>>1 <N; s++, cnt<<=1){

steps = s;

for(int i=0; i<N; i++){

L[i].nr[0] = P[s-1][i];

L[i].nr[1] = (i+cnt<N)?P[s-1][i+cnt]:-1;

L[i].p = i;

}

for(int i=0; i<N; i++){

pointers[i] = &L[i];

}

sort(L, L+N, cmp);

//sort(pointers, pointers+N, cmp);

for(int i=0; i<N; i++){

P[s][L[i].p] = (i>0 && L[i-1].nr[0]==L[i].nr[0] && L[i-1].nr[1]==L[i].nr[1])? P[s][L[i-1].p]:i;

//P[s][pointers[i]->p] = (i>0 && pointers[i-1]->nr[0]==pointers[i]->nr[0] && pointers[i-1]->nr[1]==pointers[i]->nr[1])? P[s][pointers[i-1]->p]:i;

}

}

int ans = N-L[0].p;

for(int i=1; i<N; i++){

int c = lcp(L[i-1].p, L[i].p);

ans += (N-(L[i].p)) - c;

}

cout<<ans<<endl;

int T;

scanf("%d", &T);

while(T--){

scanf("%s", S);

N = strlen(S);

build_suffix_array();

}

return 0;