FZU 1901

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int a[1000010];
char s[1000010];
int next[1000010];
int m;

void getNext(){
    int j,k;
    next[0]=-1;
    j=0;k=-1;
    while(j<m)
    {
        if(k==-1||s[j]==s[k])
        {
            j++;
            k++;
            next[j]=k;
        }
        else
            k=next[k];
    }
}

int main()
{
    int n,count = 0;
    cin >> n;
    while(n--)
    {
        count++;
        int flag = 0,sum = 0;
        cin>>s;
        m = strlen(s);
        /*for(int i =0;i <=1000002;i++)
        {
            next[i]   = 0;
            a[i] = 0;
        }*/
        getNext();
        int t=next[m];
        //cout<< t;
        while(t)
        {
            a[sum++] = m-t;
            t =next[t];
        }
        a[sum++]= m;
        cout<< "Case #"<< count << ": " ;
        cout<< sum<< endl;
        for(int i =0;i < sum;i++)
        cout<< a[i]<< " ";
        cout<<endl;
    }
    return 0;
}