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.
[[-112, -78, 33, -56, -108, 31], [-55, 46, -92, 73, -134, 26], [32, 24, -150, 9, -49, 95, 60], [-189, -161, -146, -11, 24], [-53, -18, -139, -55], [-89, -108, -68, -123, -65, -64, -96], [-123, -191, -27, -17, 25, -49, -156], [-134, 2, 22, -68, 25, 78, -57]]