3424. Suffix

Consider $n$ given non-empty strings denoted by $s_1,s_2,\dots ,s_n$. Now for each of them, you need to select a corresponding suffix, denoted by $su{f}_1,su{f}_2,\dots ,su{f}_n$. For each string $s_i$, the suffix $su{f}_i$ is a non-empty substring whose right endpoint is the endpoint of the entire string. For instance, all suffixes of the string “jiangsu” are “u”, “su”, “gsu”, “ngsu”, “angsu”, “iangsu” and itself.

All selected suffixes could assemble into a long string $T=su{f}_1,su{f}_2,\dots ,su{f}_n$. Here plus signs indicate additions of strings placing the latter at the tail of the former. your selections of suffixes would determine the lexicographical order of $T$.
Now, your mission is to find the one with minimum lexicographical order.

Here is a hint about lexicographical order. To compare strings of different lengths, the shorter string is usually padded at the end with enough “blanks” which is a special symbol that is treated as smaller than every letters.