1
class Solution:
2
    def orderlyQueue(self, s: str, k: int) -> str:
3
        if k > 1:
4
            s = list(c for c in s)
5
            s.sort()
6
            return "".join(s)
7
        s1 = s
8
        for i in range(len(s)):
9
            s = s[1:] + s[0]
10
            s1 = min(s1, s)
11
        return s1