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.
[[33, -84, 89, -178, 33, -48], [-15, -31, -154, -158, 60, -93, -125], [84, 23, -149, 84], [38, 77], [-96, 75, 13, -65, -26], [71, -163, -137, 31, 33, 29], [-125, 85, 46, -75, 33, -125]]