Alone Alice!

Alice, being alone, has thought of punishing you with a string problem. Alice has a string $S$ of length $N$. From $S$, she forms a new string $T$ in the following way: - Add all **distinct subarrays** of $S$ which are [palindromes](https://en.wikipedia.org/wiki/Palindrome) to a set. - Sort the set in **lexicographically ascending** order. - Initialise $T$ as empty string and append each palind