Given an array of non-negative integers and an integer m, split the array into m non-empty contiguous subarrays. Return the minimum possible value of the largest subarray sum.