M-Subarrays

Moamen has an array of n distinct integers. He wants to sort that array in non-decreasing order by doing the following operations in order exactly once . 1. Split the array into exactly M non-empty subarrays such that each element belongs to exactly one subarray. 2. Reorder these subarrays arbitrary. 3. Merge the subarrays in their new order. A sequence a is a subarray of a sequence b if a can be