Simple C solution with O(m+n) complexity
\nbool searchMatrix(int** matrix, int matrixSize, int* matrixColSize, int target){\n    int x = 0, y = *matrixColSize - 1;\n    while(x < matrixSize && y >= 0)\
```\nbool searchMatrix(int** matrix, int matrixSize, int* matrixColSize, int target){\n    int x = 0, y = *matrixColSize - 1;\n    while(x < matrixSize && y >= 0)\n        if(matrix[x][y] < target)\n            x++;\n        else if(matrix[x][y] > target)\n            y--;\n        else\n            return true;\n    return false;\n}\n```
['C']