F - Lexicographic Raffle

You have a string $S$ of length $N$ consisting of lower-case English characters. The process $\text{raffle}(L, R)$ for $1 \le L < R \le N$ is defined as follows: - **Step** $1$: Let $X$ be the substring $S_LS_{L + 1}\ldots S_{R - 1}$ and $Y$ be the substring $S_{L + 1}S_{L + 2}\ldots S_R$. - **Step** $2$: If $Y$ is **lexicographically smaller**$^{\dagger}$ than $X$, increment $L$ by $1$. Otherw