Write an efficient algorithm that searches for a value in an `m x n`

matrix, and return the number of occurrances of the target.

This matrix has the following properties:

- Integers in each row are sorted from left to right.
- Integers in each column are sorted from up to bottom.
- No duplicate integers in each row or column.

Example

```
[
[1, 3, 5, 7],
[2, 4, 7, 8],
[3, 5, 9, 10]
]
target = 3, return 2
target = 4, return 1
```