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.
[[21, -155, 40, -15, 28], [30, -165], [69, -9, 29, -167], [100, -92], [-28, 87], [-173, -195, -75, 76, -130], [2, -73, 33, -68], [-80, -154, -109, 55], [93, 52, -147, -118, -121, -75, -158]]