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.
[[-12, -92, -53, 95, 96, 40, -178], [-135, -60, -19, -83, -68, -43, -49], [-166, -58, 25], [-96, -74, 81], [-69, -135, -113, 79, 38], [1, 8, -162], [-17, -18, 6, -69], [-162, -72, -5, -76], [80, -6, -5]]