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.
[[-138, -110, 8], [-70, -92, 75, 0, -62, -178, -22], [10, -119, -121, -152, 32, -124, -101], [25, -96, -22, -44, -172, -11, -29], [-30, 38], [32, 2]]