Given a 2d matrix where rows are sorted. find the kth smallest element.

how to solve this optimally?