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.
[[35, -130, 6, -75, 19, -9], [58, 21, 83, -150, -16, 30, -94], [96, -29], [-57, -7, 51, -141, -124, -60, -171]]