Simple Rows (Easy)
A string is termed simple if it is lexicographically smaller than any of its suffixes. Additionally, any string consisting of a single character is also considered simple. For instance, the strings a, abb, aabb, and abac are simple, whereas the strings aa, baa, acab, and abcabc are not.
It is established that any string can be uniquely decomposed into a concatenation of a lexicographically non-increasing sequence of simple strings. Your task is to write a program that performs this decomposition.
Input
The input consists of a single string S, which needs to be decomposed into a concatenation of simple strings. The string contains no more than 100 lowercase Latin letters and is non-empty.
Output
Output the required decomposition, with each element on a new line.