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.
[[-36, -189, -185, 75, -189, -167, -176], [-178, -152], [84, 38, -39, -21, 70, -128], [-136, -63], [47, -106, 91, -96, -40, 99], [-38, -46, -81, -85, 40, -119], [-104, 36], [-42, 41, 58, -34]]