16. In an $\mathrm{m}$-row $\mathrm{n}$-column grid, it is stipulated: the horizontal rows from top to bottom are sequentially the 1st row, the 2nd row, ..., and the vertical columns from left to right are sequentially the 1st column, the 2nd column, .... The point $(\mathrm{a}, \mathrm{b})$ represents the grid point located in the $\mathrm{a}$-th row and the $\mathrm{b}$-th column. Figure 7 is a 4-row 5-column grid. Starting from point $\mathrm{A}(2,3)$, following the "ri" (日) character movement of a knight in Chinese chess, it can reach the grid points B (1, 1), C (3, 1), D $(4,2)$, E $(4,4)$, F $(3,5)$, G $(1,5)$. If in a 9-row 9-column grid (Figure 8), starting from point $(1,1)$, following the "ri" (日) character movement of a knight in Chinese chess,
(1) Can it reach every grid point in the grid?
Answer: $\qquad$ (Fill in "Yes" or "No")
(2) If yes, then along the shortest route to reach a certain grid point, what is the maximum number of steps needed? How many such grid points are there? Write down their positions. If not, please explain the reason.
Can. At most 6 steps (7, 9) (8, 8) (9, 7) (9, 9)