Given an M x N matrix and an integer K, return the max sum of a rectangle in the matrix such that it consisted of no more than K cells.

Looks similar to https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/,
but a bit different constraint.