Leetcode 3256. Maximum Value Sum by Placing Three Rooks I

Select three cells on an m×n board (rooks cannot attack, so all three must have distinct rows and columns) to maximize the sum of their values. Equivalently, compute the maximum-weight matching of size three between rows and columns (m,n ≤ 100, values can be negative).