You are given an integer s and an integer k. Find k positive integers a1, a2, ..., ak such that their sum is equal to s and their product is the maximal possible. Return their product.
|-||For all valid inputs, the return value will fit in a long.|
|-||k will be between 1 and 20, inclusive.|
|-||s will be between k and 100, inclusive.|