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.
[[58, -61, 45, -170, 15, 24, -72], [56, -179, 56, 6, -193, -51], [51, -109], [2, -177, -190, -14, 99, -179, -7], [-32, 92, -198, -46], [-186, 75, -184]]