VN-TST 2012 Problem 2

Consider a $m\times n$ rectangular grid with $m$ rows and $n$ columns. There are water fountains on some of the squares. A water fountain can spray water onto any of it's adjacent squares, or a square in the same column such that there is exactly one square between them. Find the minimum number of fountains such that each square can be sprayed in the case that a) $m=4$ ; b) $m=3$ .