A graph is $(a,b)$-choosable if for any assignment of a list of $a$ colours to each of its vertices there is a subset of $b$ colours from each list such that the subsets of adjacent vertices are disjoint.If $G$ is $(a,b)$-choosable then $G$ is $(am,bm)$-choosable for every integer $m\ge 1$.