I - Suffix Array

You are given a string $S$ of length $N$. The suffix strings of $S$ are the non-empty strings which can be formed by deleting some (possibly $0$) characters from the beginning of $S$, i.e. for each $i$ ($1 \leq i \leq N$), the substring $S_i S_{i + 1} \ldots S_N$ is a suffix of $S$. There are $N-1$ suffix strings of $S$ that have length $\geq 2$. Your task is to sort these suffix strings of $