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.
[[24, -124, -150, -116], [-137, 47], [-107, 90, -9, -93], [66, -22, -159], [-96, -92, -182, -90, -116, -73], [-11, 56, -52, -156, -164, -7], [-139, -116, -168], [2, -151, -8, -29, 46, -35]]