leetcode: Search a 2D Matrix

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 from left to right.

the first integer of each row is greater than the last integer of the

previous row.

for example,

consider the following matrix:

given target = <code>3</code>,

return <code>true</code>.