```
class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
return any(target in row for row in matrix if target <= row[-1])
```

This is one-line solution, easy to understand, time complexity could be O(m * n).