class Solution {
    public String lexSmallest(String s) {
        int n = s.length();
        String smallest = s; 
        for (int k = 1; k <= n; k++) {
        
            String firstK = new StringBuilder(s.substring(0, k)).reverse().toString() + s.substring(k);
            if (firstK.compareTo(smallest) < 0) {
                smallest = firstK;
            }

          
            String lastK = s.substring(0, n - k) + 
                           new StringBuilder(s.substring(n - k)).reverse().toString();
            if (lastK.compareTo(smallest) < 0) {
                smallest = lastK;
            }
        }

        return smallest;
    }
}

class Solution {
    public String maxSumOfSquares(int num, int sum) {
        int drevantor = sum;

        if (sum > 9 * num) return "";
        if (sum < 0) return "";

        StringBuilder sb = new StringBuilder();

        for (int i = 0; i < num; i++) {
            int digit = Math.min(9, sum); 
            sb.append(digit);
            sum -= digit;
        }

        if (sum > 0) return ""; 

        return sb.toString();
    }
}