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.
[[-11, -162, -182], [-65, -109, 12, -19], [-15, 39, -16, 42], [-60, -177, -141], [20, -133, -158, -18], [-145, 3, -42], [70, -192]]