human
Can you provide a the Python program you requested given the following:
Solve in Python:
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

       Integers in each row are sorted in ascending from left to right.
       Integers in each column are sorted in ascending from top to bottom.

Example:

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.
assistant
#Here is the Python program you requested.

class Solution:
     def searchMatrix(self, matrix, target):
         """
         :type matrix: List[List[int]]
         :type target: int
         :rtype: bool
         """
         if len(matrix) == 0 or len(matrix[0]) == 0:
             return False
         m = 0
         n = len(matrix[0]) - 1
         while m < len(matrix) and n >= 0:
             if target == matrix[m][n]:
                 return True
             elif target < matrix[m][n]:
                 n -= 1
             elif target > matrix[m][n]:
                 m += 1
         return False