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.
[[-177, 39, -13, -141], [-9, -115, -32, -142, 43, -39], [-42, 95, -116, -19, -200, 46, 97], [-31, 48, -165, -156], [-93, -188, -83, -35], [-190, -40, 0], [7, -75, 68, -126, -89], [-112, -117, 35, -195, 70, -180]]