Edmonds' fundamental theorem on arborescences characterizes the existence of $k$ pairwise arc-disjoint spanning with prescribed root sets in a digraph. In this paper, we study problem packing branchings digraphs under cardinality constraints their by arborescence augmentation. Let $D=(V+x,A)$ be digraph, $\mathcal{P}=$ $\{I_{1}, \ldots, I_{l} \}$ partition $[k]$, $c_{1}, c_{l}, c'_{1}, c'_{l}$ ...