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.
[[1, -174, 61], [-56, -140, 57], [100, -66, -24, -71, 75, -109, 75], [-56, 67, 66, -119, -175, -78, -54], [-27, -42], [-30, 21], [15, -67, -99, -98, 25, -179]]