Hall numbers of some complete $k-$partite graphs

The Hall number is a graph parameter closely related to the choice number. Here it is shown that the Hall numbers of the complete multipartite graphs $K(m,2,\dots ,2)$, $m\ge 2$, are equal to their choice numbers.