Leetcode 2428. Maximum Sum of an Hourglass

Find the maximum sum of any fixed 7-cell "hourglass" shape (three cells in a top row, the middle cell of the next row, and three cells in the bottom row) placed entirely inside an m×n integer grid. m,n are between 3 and 150 and grid values are small nonnegative integers.