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.
[[-71, -63, -99], [-27, -61, 12, 57, 22, -182], [-176, -98, -91], [25, 79, -56, -110, -180], [69, -47, -145, -197], [-33, 97, 37, 43, -154], [-86, -6, 78, -96, -116, 85], [59, -15, -60, -143, 97, -12, -126], [-45, -141]]