Král' and Sgall (J Graph Theory 49(3) (2005), 177-186) introduced a refinement of list coloring where every color list must be subset to one predetermined palette of colors. We call this (k, )-choosability when the palette is of size at most and the lists must be of size at least k. They showed that, for any integer k ≥ 2, there is an integerthen it is C-choosable, and asked if C is required to be exponential in k. We demonstrate it must satisfy-choosable, then we more generally supply a lower bound on C(k, ), one that is super-polynomial in k if = o(k 2 / ln k ), by relation to an extremal set theoretic property. By the use of containers,