#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <algorithm>
#include <climits>
using namespace
 
 std;

#define LS 2*i
#define RS 2*i+1
#define UP(i,x,y) for(i=x;i<=y;i++)
#define DOWN(i,x,y) for(i=x;i>=y;i--)
#define MEM(a,x) memset(a,x,sizeof(a))
#define W(a) while(a)
#define gcd(a,b) __gcd(a,b)
#define LL long long
#define N 100005
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define EXP 1e-8
LL wa[N],wb[N],wsf[N],wv[N],sa[N];
LL rank1[N],height[N],s[N],a[N];
char
 
 str[N],str1[N],str2[N];
//sa:字典序中排第i位的起始位置在str中第sa[i]
//rank:就是str第i個位置的字尾是在字典序排第幾
//height：字典序排i和i-1的字尾的最長公共字首
LL cmp(LL *r,LL a,LL b,LL k)
{
    return r[a]==r[b]&&r[a+k]==r[b+k];
}
void getsa(LL *r,LL *sa,LL n,LL m)//n要包含末尾新增的0
{
    LL i,j,p,*x=wa,*y=wb,*t;
    for(i=0; i<m; i++)  wsf[i]=0;
    for
 
(i=0; i<n; i++)  wsf[x[i]=r[i]]++;
    for(i=1; i<m; i++)  wsf[i]+=wsf[i-1];
    for(i=n-1; i>=0; i--)  sa[--wsf[x[i]]]=i;
    p=1;
    j=1;
    for(; p<n; j*=2,m=p)
    {
        for(p=0,i=n-j; i<n; i++)  y[p++]=i;
        for(i=0; i<n; i++)  if(sa[i]>=j)  y[p++]=sa[i]-j;
        for(i=0; i<n; i++)  wv[i]=x[y[i]];
        for(i=0; i<m; i++)  wsf[i]=0;
        for(i=0; i<n; i++)  wsf[wv[i]]++;
        for(i=1; i<m; i++)  wsf[i]+=wsf[i-1];
        for(i=n-1; i>=0; i--)  sa[--wsf[wv[i]]]=y[i];
        t=x;
        x=y;
        y=t;
        x[sa[0]]=0;
        for(p=1,i=1; i<n; i++)
            x[sa[i]]=cmp(y,sa[i-1],sa[i],j)? p-1:p++;
    }
}
void getheight(LL *r,LL n)//n不儲存最後的0
{
    LL i,j,k=0;
    for(i=1; i<=n; i++)  rank1[sa[i]]=i;
    for(i=0; i<n; i++)
    {
        if(k)
            k--;
        else
            k=0;
        j=sa[rank1[i]-1];
        while(r[i+k]==r[j+k])
            k++;
        height[rank1[i]]=k;
    }
}
LL t,ans,n,m;

int main()
{
    LL i,j,k,len;
    W(~scanf("%s",str))
    {
        len = strlen(str);
        UP(i,0,len-1)
        s[i]=str[i];
        s[len] = 0;
        getsa(s,sa,len+1,300);
        getheight(s,len);
        ans = (1+len)*len/2;
        UP(i,2,len)
        ans-=height[i];
        printf("%lld\n",ans);
    }
}

#include <iostream> 
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
using namespace std;
int a[1010][1010][2], f[4][2] = {0,1,1,0,0,-1,-1,0};
int vis[1010][1010], n;
int dp[1010][1010][2][2];
struct node
{
	int x, y;
}s, e;
int bfs()
{
	memset(vis, 0, sizeof(vis));
	memset(dp, 0x3f3f3f3f, sizeof(dp));
	queue<node>q;
	s.x=1, s.y=1;
	if(a[1][1][0]<=a[1][1][1])
	{
		 dp[1][1][0][0] = a[1][1][0];
		 dp[1][1][0][1] = a[1][1][1];
	}
	else 
	{
		dp[1][1][1][0] = a[1][1][0];
		dp[1][1][1][1] = a[1][1][1];
	}
	vis[1][1]=1, q.push(s);
	while(!q.empty())
	{
		s=q.front(), q.pop();
		for(int i=0; i<4; i++)
		{
			e.x = s.x+f[i][0];
			e.y = s.y+f[i][1];
			if(e.x<1||e.x>n||e.y<1||e.y>n) continue;
			for(int k=0; k<2; k++)
			{
				int n2 = dp[s.x][s.y][k][0]+a[e.x][e.y][0];
				int n5 = dp[s.x][s.y][k][1]+a[e.x][e.y][1];
				if(n2<=n5 && dp[e.x][e.y][0][0]>n2)
				{
					dp[e.x][e.y][0][0] = n2;
					dp[e.x][e.y][0][1] = n5;
					if(!vis[e.x][e.y]) 
					{
						vis[e.x][e.y]=1, q.push(e);
					}
				}
				else if(n2>n5 && dp[e.x][e.y][1][1]>n5)
				{
					dp[e.x][e.y][1][0] = n2;
					dp[e.x][e.y][1][1] = n5;
					if(!vis[e.x][e.y])
					{
						vis[e.x][e.y]=1, q.push(e);
					}
				}
			}
		}
	}
	return min(dp[n][n][0][0], dp[n][n][1][1]);
}
int main()
{
	while(~scanf("%d", &n))
	{
		int x;
		for(int i=1; i<=n; i++)
		{
			for(int j=1; j<=n; j++)
			{
				scanf("%d", &x);
				int num2=0, num5=0;
				while(x%2==0) num2++, x/=2;
				while(x%5==0) num5++, x/=5;
				a[i][j][0] = num2;
				a[i][j][1] = num5;
			}
		}
		printf("%d\n", bfs());
	}
	return 0;
}

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef long long LL;
LL block[2][2];///儲存矩陣
LL tblock[2][2];
LL x,y;

void mul1(LL p)
{
    for(int i=0; i<2; i++){
        for(int j=0; j<2; j++){
            tblock[i][j] = 0;
            for(int k=0; k<2; k++)
                tblock[i][j] = (tblock[i][j] + block[i][k] * block[k][j]) % p;///1 1 = 10 * 0 1 + 11 * 11
        }
    }

    for(int i=0; i<2; i++)
        for(int j=0; j<2; j++)
           block[i][j] = tblock[i][j];
}

void mul2(LL p)
{
    LL ans = 0;
    LL t1,t2;
    t2 = block[0][1] * x % p + block[1][1] * y % p;
    t1 = block[0][0] * x % p + block[1][0] * y % p;
    x = t1 % p;
    y = t2 % p;
}

int main()
{
    int t;
    scanf("%d",&t);
    for(int cas = 1; cas <= t; cas++){
        LL a,b,p,n;
        scanf("%lld %lld %lld %lld %lld %lld",&x,&y,&a,&b,&p,&n);
        block[0][0] = 0;
        block[0][1] = a;
        block[1][0] = 1;
        block[1][1] = b;
        LL ans = 0;
        while(n){
            if(n & 1) mul2(p);
            mul1(p);
            n = n >> 1;
        }
        printf("Case #%d: %lld\n",cas,y);
    }
    return 0;
}

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <list>
#include <algorithm>
#include <climits>
using namespace std;

#define lson 2*i
#define rson 2*i+1
#define LS l,mid,lson
#define RS mid+1,r,rson
#define UP(i,x,y) for(i=x;i<=y;i++)
#define DOWN(i,x,y) for(i=x;i>=y;i--)
#define MEM(a,x) memset(a,x,sizeof(a))
#define W(a) while(a)
#define gcd(a,b) __gcd(a,b)
#define LL long long
#define N 200005
#define INF 0x3f3f3f3f
#define EXP 1e-8
#define lowbit(x) (x&-x)
const int mod = 1e9+7;
const int L = 10005;
struct Edges
{
    int x,y,w,next;
} e[L<<2];

int head[L],n,m;
int dis[L];
int vis[L];
int cnt[L],hash[L],ss[L];
int s[L];
void init()
{
    memset(e,-1,sizeof(e));
    memset(head,-1,sizeof(head));
}
void AddEdge(int x,int y,int w,int k)
{
    e[k].x = x,e[k].y = y,e[k].w = w,e[k].next = head[x],head[x] = k;
}
int relax(int u,int v,int c)
{
    if(dis[v]>dis[u]+c)
    {
        dis[v] = dis[u]+c;
        return 1;
    }
    return 0;
}

int SPFA(int src)
{
    int i;
    memset(vis,0,sizeof(vis));
    for(int i = 0; i<=n; i++)
        dis[i] = INF;
    dis[src] = 0;
    queue<int> Q;
    Q.push(src);
    vis[src] = 1;
    while(!Q.empty())
    {
        int u,v;
        u = Q.front();
        Q.pop();
        vis[u] = 0;
        for(i = head[u]; i!=-1; i=e[i].next)
        {
            v = e[i].y;
            if(relax(u,v,e[i].w)==1 && !vis[v])
            {
                Q.push(v);
                vis[v] = 1;
            }
        }
    }
    int maxn = -1;
    for(i = 1; i<=n; i++)
        maxn = max(maxn,dis[i]);
    return maxn;
}

int ans[L],tot,p[N];
int main()
{
    int t,u,v,i,j,k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        init();
        for(i = 0; i<2*m; i+=2)
        {
            scanf("%d%d",&u,&v);
            AddEdge(u,v,1,i);
            AddEdge(v,u,1,i+1);
        }
        int minn = INF;
        for(i = 1; i<=n; i++)
        {
            p[i] = SPFA(i);
            minn = min(p[i],minn);
        }
        tot = 0;
        for(i = 1; i<=n; i++)
        {
            if(p[i]==minn)
                ans[tot++] = i;
        }
        printf("%d\n",tot);
        for(i = 0; i<tot; i++)
        {
            if(i)
                printf(" ");
            printf("%d",ans[i]);
        }
        printf("\n");
    }

    return 0;
}