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.
[[-29, -149, 30, -180, -165], [71, -38, -4, -48, 60, -114], [-79, -93, -150, -70, -75, -124, 38], [-97, 68, -15, -2], [6, -26, 77], [-159, 6, 56], [47, -91, -168, -107, -79, 5, 68], [-172, 35]]