Constructing a partition of a finite nonempty set from a partition of its cardinality

Question

Let $E$ be finite nonempty set of cardinality $n$. Let $(k_i)_{i\in I}$ be a finite family of integers $>0$ such that $$\sum_{i\in I} k_i=n.$$ Since $|E|=n$, there exists a bijection $x:[1,n]\rightarrow E$ and we can write $E=\{x_1,\ldots,x_n\}$. I want to use the finite family $(k_i)_{i\in I}$ to construct a partition of $(X_i)_{i\in I}$ of $E$ such that $$|X_i|=k_i$$ for each $i\in I$. Is there a way to do this?