Given a list of names, a corresponding list of int sizes, and an int box_size, this time we want to keep packing items into boxes of the given box_size until its full, and then start filling another box of the same size. we return a list of filled boxes as a list of lists of strings. oversized items are immediately placed into our output in a list by themselves, with an asterisk prefix to indicate that it does not fit. (we continue filling the current box after an oversized item). items are only considered in their given ordering; do not reorder the items to seek a better packing list! create and return this list of lists, each one containing items in one box or the single oversized item.