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.
[[43, -173, -89, -186, -20, 67], [-149, 29, -58, -47], [-193, -116, -58], [52, -83, -174, -153, -175, -177, -99], [30, -121, 9, 28, 14, -120, -7], [-189, -28, -57], [-132, -52, -195, -6, 64], [-95, 1, -188, 9, 13, -95]]