Largest String After Shifts

You are given a list of $\bf{strings}$, `strs` consisting of lowercase alphabets of length $N$. For each of the $i^{th}$ string, print the **lexicographically largest** string after performing any number of $\bf{shifts}$ on `strs[i]`, $\forall_i$ such that $0 \leq i \lt N$. A $\bf{shift}$ on `strs[i]` consists of moving the rightmost character of `strs[i]` to the leftmost position. ### Input -