Inside a convex polygon several pairwise nonintersecting dis

Inside a convex polygon several pairwise non-intersecting disks are placed. Prove that it is possible to cut the polygon into smaller polygons so that all these polygons are convex and each of them contains exactly one of the given disks.

Solution

This is possible due to pigeonhole principle.The pigeon hole principle dels with finite set.