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.
[[-150, -29, -173, -132, -51, -1, -124], [-58, -101], [-9, -145, -92, -68, -108, -174, -47], [75, -97], [94, -98, -96], [92, 44, 68, -9, 69, -65], [27, -70, -56, -76], [-76, -21, 2, -53, 9, -178], [80, -13, 46, -79]]