Find all pairs of integers $(m,n)$ such that an $m\times n$ board can be totally covered with non-overlapping $1\times 3$ and $2 \times 5$ pieces.