class Solution {
public:
vector<vector<int>> g;
int n, m;
void f(int x, int y){
int maxv = -2;
for(int i = 0; i < n; i++)
maxv = max(maxv, g[i][y]);
g[x][y] = maxv;
}
vector<vector<int>> modifiedMatrix(vector<vector<int>>& matrix) {
g = matrix;
n = g.size(), m = g[0].size();
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
if(g[i][j] == -1)
f(i, j);
return g;
}
};