#include <iostream>

 #include <string>

 #include <algorithm>

 #define MAXN 400005

 using namespace std;

 char _m[MAXN];

 int next[MAXN];

 void give_next(int len);

 int ans_len[MAXN];

 int ans_len_index;

 int ans[MAXN];

 bool take_judge(int b,int len);

 int main()

 {

     //freopen("acm.acm","r",stdin);

     string s;

     int i;

     int j;

     int len;

     int index;

     int cur;

     //int ans;

     while(getline(cin,s))

     {

         if(s.length() == )

         {

             break;

         }

         index = ;

         //cout<<s<<endl;

         //ans = 0;

         //cout<<s<<endl;

         for(i = ; i < s.length(); ++ i)

         {

             _m[i] = s[i];

         }

         memset(next,-,sizeof(next));

         give_next(s.length());

         i = s.length();

         //cout<<i<<" ";

         ans[index ++] = i;

         for(; next[i] != ; i = next[i])

         {

             //cout<<next[i]<<" ";

             ans[index++] = next[i];

         }

         for(i = index-; i >= ; -- i)

         {

             cout<<ans[i]<<" ";

         }

         cout<<ans[i]<<endl;

         //cout<<endl;

       //  cout<<endl;

     }

     return ;

 }

 bool take_judge(int b,int len)

 {

     int j = ;

     int i;

     for(i = b; i < len; ++ i,++ j)

     {

         if(_m[i] != _m[j])

         {

             break;

         }

     }

     if(i == len)

     {

         return true;

     }

     return false;

 }

 void give_next(int len)  //此为求next 数组的方法。

 {

     int i;

     int j;

     i = ;

     j = -;

     next[] = -;

     while(i < len)

     {

         if(j == - || _m[i] == _m[j])

         {

             i ++;

             j ++;

             next[i] = j;

         }

         else

             j = next[j];

     }

 }