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.
[[74, 44, -62, -115], [-166, 51], [-61, 86, -32, -146, -172], [31, 38, -66, 48, -41, -6], [-100, -148, -96, -55], [-21, 82, 30, -106], [38, -82, -15], [35, -137, -22]]