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.
[[-76, -26, -165, 74, -62, -180], [-158, -35, 27, -66, 18, -96], [-179, 74, -55, -47], [-123, -82, 29], [-160, -129, -59, -187, -32], [-152, 89, 99, 79, 46]]