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.
[[-2, -59, -64, 100, -151, -138], [11, -13, -180, -107, -158], [-19, -57], [-131, 46, -91, 11, -116], [32, -43, 52, -55, 49, -29], [-75, 86, -50], [-146, -68, -10, -123, -95, -64, 64], [-139, -81, 99], [66, -146, -95, -106, -164]]