Given any finite multiset $\\{k_1, \\ldots, k_n\\}$ of integers greater than $1$, we construct a polynomial in $\\operatorname{Int}(D)$ which has exactly $n$ essentially different factorizations into irreducibles in $\\operatorname{Int}(D)$, the lengths of these factorizations ...