Let be a positive integer, and let be a subset of . An -partition of into parts is a representation of n as a sum , where the parts belong to and are not necessarily distinct. The number of different parts in such a partition is the number of (distinct) elements in the set . We say that an -partition of into parts is optimal if there is no -partition of into parts with . Prove that any optimal -partition of contains at most different parts.