Minimum Divisibility Set

Consider any two sets of integers strictly larger than $1$, denoted by $P$ and $Q$. The set $P$ is said to be *divisible* by $Q$ if each integer in $P$ is divisible by at least one (not necessarily the same for each of them) integer in $Q$. You are given a set $A = \{A_1, A_2, \ldots, A_N\}$, where $A_i \le C$ for each valid $i$ (note that $C$ does not necessarily equal $\max(A)$). Find any set