Write an efficient algorithm that searches for a value in a 2D matrix. The matrix has the following properties:

• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row. Input Format: The first line contains the number of rows and columns in the matrix, separated by a space. The next lines contain the matrix elements, with each row on a new line and elements separated by spaces. The last line contains the target value. Output Format: true if the target is found, false otherwise.