Eddy likes to play with string which is a sequence of characters. One day, Eddy has played with a string S for a long time and wonders how could make it more enjoyable. Eddy comes up with following procedure:. Eddy can't find any efficient way to compute the final result. As one of his best friend, you come to help him compute the answer!
Eddy likes to play with string which is a sequence of characters. One day, Eddy has played with a string S for a long time and wonders how could make it more enjoyable. Eddy comes up with following procedure: 1. For each i in [0,|S|-1], let Si be the substring of S starting from i-th character to the end followed by the substring of first i characters of S. Index of string starts from 0. 2. Group up all the Si. Si and Sj will be the same group if and only if Si=Sj. 3. For each group, let Lj be the list of index i in non-decreasing order of Si in this group. 4. Sort all the Lj by lexicographical order. Eddy can't find any efficient way to compute the final result. As one of his best friend, you come to help him compute the answer!
（图片来源网络，侵删）
