Three, (50 points) Let $A=\{i \in \mathbf{N} \mid 1 \leqslant i \leqslant$ $2880\}, B \subseteq A,|B| \geqslant 9$. If all elements in set $A$ can be represented by the sum of no more than 9 different elements from $B$, find $\min |B|$, and construct a set corresponding to the minimum $|B|$.