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.
[[-170, 31, 66, 89, -93], [-16, -170, 51, 60, -36, 56], [-49, 63], [41, 84, -60, 70, 63, -128, 30], [26, -111, -160, -171, -37], [12, -182, -77, -137], [-146, -37, 96, -168, -128, 35], [18, 34, -26, 30], [-24, -59, -2, -125, -156, -107, -8]]