In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[-143, 16, -27, 93, -28], [92, -175, 16, 24, -67], [-126, -131], [-106, -37, -30, -200], [-161, -108, 43, 67, 27], [-39, -53, -83, -53], [59, -116], [9, -69, -28, -109], [11, -58]]