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.
[[40, -156], [-1, -65, -42, 92, -153, -87], [-120, -177], [-115, 59, 13, 82, -108, -114, 38], [-117, -80, -48, 5, -112, -67, 98], [84, 24, 43, -124, -162, 53], [-130, -40, 59, 77, -2, -46, -151], [38, -55, 81, -159, -199]]