Problem Description

Welcome to the ECUSTPC 2025 contest!
In this 4-hour contest, you will work together with Maddy and face these interesting problems!
Maddy’s next task for you is to operate on the specific string ECUST. You need to generate all strings that are equal to ECUST case-insensitively.
All strings you generate must be pairwise distinct, and you must output them in increasing lexicographical order by ASCII code.

Input Format

This problem has no input.
Note that, technically, this problem will provide a random one-line string as input. You do not need to read this string; you only need to produce the correct output.

Output Format

Output several lines. Each line contains a string that is equal to ECUST case-insensitively. You need to sort these strings by ASCII lexicographical order.

NO_INPUT

ECUST
ECUSt
ECUsT
<lines omitted>
ecust

Hint

Hint

String $a$ is smaller than string $b$ in ASCII lexicographical order if and only if one of the following conditions holds:

• $a$ is a prefix of $b$.
• At the first position where $a$ and $b$ differ, the ASCII code value of the character in $a$ at that position is smaller than that in $b$.

Two strings are equal case-insensitively if and only if they become equal after converting all uppercase letters in both strings to the corresponding lowercase letters. For example, ECUST, ecust, and eCuSt are equal case-insensitively.
The ASCII code of digit $0$ is $48$, the ASCII code of uppercase letter $A$ is $65$, and the ASCII code of lowercase letter $a$ is $97$.

This problem has no input. The output will only show an example of the output format rather than the complete correct output, and the sample for this problem will not appear in the additional files.

Translated by ChatGPT 5