#include <bits/stdc++.h>
using namespace std;
char fw[200005];
int fwlen, lst, tot, head[200005], sze;
struct node {
  int to, nxt;
} e[200005 * 2];
struct node2 {
  int nxt[27], len, link;
} st[200005 * 2];
void build(int a, int b) {
  e[++tot].to = b;
  e[tot].nxt = head[a];
  head[a] = tot;
}
long long ans, f[200005 * 2];
void add(int c) {
  int p = lst, cur = ++sze;
  f[cur] = 1;
  lst = cur;
  st[cur].len = st[p].len + 1;
  while (p != -1 && !st[p].nxt[c]) st[p].nxt[c] = cur, p = st[p].link;
  if (p == -1) {
    return;
  }
  int q = st[p].nxt[c];
  if (st[p].len + 1 == st[q].len) {
    st[cur].link = q;
    return;
  }
  int clone = ++sze;
  st[clone] = st[q];
  st[clone].len = st[p].len + 1;
  while (p != -1 && st[p].nxt[c] == q) {
    st[p].nxt[c] = clone;
    p = st[p].link;
  }
  st[q].link = st[cur].link = clone;
}
void dfs(int p) {
  for (int i = head[p]; i; i = e[i].nxt) {
    dfs(e[i].to);
    f[p] += f[e[i].to];
  }
  if (p == 0) return;
  ans += f[p] * f[p] * (st[p].len - st[st[p].link].len);
}
int main() {
  int n;
  scanf("%d", &n);
  while (n--) {
    tot = sze = ans = lst = 0;
    memset(f, 0, sizeof f);
    memset(st, 0, sizeof st);
    memset(head, 0, sizeof head);
    scanf("%s", fw);
    fwlen = strlen(fw);
    st[0].link = -1;
    for (int i = 0; i < fwlen; ++i) {
      add(fw[i] - 'a');
    }
    for (int i = 1; i <= sze; ++i) build(st[i].link, i);
    dfs(0);
    printf("%lld\n", ans);
  }
  return 0;
}
