POJ2752KMP

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;


public class Main {

        public static void main(String[] args) throws IOException{
                InputReader in = new InputReader(System.in) ;
                StreamTokenizer cin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
                PrintWriter out = new PrintWriter(System.out);

               // String word ;
                while(cin.nextToken() != cin.TT_EOF){
                      ArrayList<Integer> g = new KMP(cin.sval.toCharArray()).PrefixandSuffix() ;
                      for(int e : g) out.print(e + " ") ;
                      out.println() ;
                     // out.flush() ;
                }

                out.flush() ;
        }

}


class KMP{
      int m ;
      char[] p ;
      int[] fail ;

      KMP(char[] p){
          m = p.length ;
          this.p = p ;
          fail = new int[m+1] ;
          int crt = fail[0] = -1 ;
          for(int i = 1 ; i <= m ; i++){
               while(crt >= 0 && p[crt] != p[i-1]) crt = fail[crt] ;
               fail[i] = ++ crt ;
          }
      }

      public int Power(){
             if(m % (m - fail[m]) == 0) return  m / (m - fail[m]) ;
             return 1 ; 
      }

      public ArrayList<Integer>  PrefixandSuffix(){
             ArrayList<Integer> g = new ArrayList<Integer>(); 
             int k = m ;  
             while(fail[k] != -1){
                   g.add(k) ;
                   k = fail[k] ;
             }
             Collections.sort(g) ;
             return g  ;
      }   

      public int searchForm(char[] txt){
             int n = txt.length , count = 0 ;
             for(int i = 0 , j = 0 ; i < n ; i++){
                   while(j >= 0 && txt[i] != p[j]) j = fail[j] ;
                   if(++j == m){
                         count++ ;
                         j = fail[j] ;
                         //j = 0 ;
                   }
             }
             return  count ;
      }
}



class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

}