Find the Lexicographically Largest String From the Box I

Given a string and integer k, consider every way to split the string into k non‑empty contiguous parts; among all parts across all splits, return the lexicographically largest string. Equivalently, this is the lexicographically largest substring of length at most n−k+1.