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.
[[-25, 17, 38], [25, -62, -2, -107, -146, -111], [-139, 26, 67, -167, -95, -145, -16], [-6, -57], [68, 43, 2, -29, 9], [44, -55, -8, 0, -21, -9], [-40, -15, -36, 25, 53], [55, 80, -57, -66]]