Given an m x n grid of non-negative numbers, find a path from the top-left to the bottom-right that minimizes the sum of numbers along it, moving only right or down. Return that minimum sum.