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.
[[-9, -33, 69, 47, 42], [-10, -28, -19, -142, -153, -181, -141], [9, -164, -160, -154], [-186, 50, 8, -72], [-122, -141], [11, 5, 19, -57, 65, 49, -96], [-86, -113, -169], [-161, 12, -65, -164, -177, -130], [-28, -78, -198]]