DE-MO 2021 Problem 3

For a fixed $k$ with $4 \le k \le 9$ consider the set of all positive integers with $k$ decimal digits such that each of the digits from $1$ to $k$ occurs exactly once.

Show that it is possible to partition this set into two disjoint subsets such that the sum of the cubes of the numbers in the first set is equal to the sum of the cubes in the second set.