Given integers n and m, return an array of length n that strictly increases for some prefix and then strictly decreases, using each element in [1, m]. Maximize the lexicographic order. Return [] if impossible.