class Solution {
public int maximumWealth(int[][] acc) {
int m = acc.length;
int n = acc[0].length;
int ans = 0;
for (int i = 0; i < m; i++) {
int val = 0;
for (int j = 0; j < n; j++) {
val += acc[i][j];
}
ans = Math.max(ans, val);
}
return ans;
}
}