  We show that for any colouring of the edges of the complete bipartite graph
$K_{n,n}$ with 3 colours there are 5 disjoint monochromatic cycles which
together cover all but $o(n)$ of the vertices. In the same situation, 18
disjoint monochromatic cycles together cover all vertices.
