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.
[[41, 10, 63], [-162, 50, -147, -65, 81, -75, -87], [-141, -199, -151, 93, 81, -159], [-34, 60, -83], [-52, -142, -73, -96, -189, 1, -78], [-2, -92, -196, -26, -127, 24], [-128, -190, -149, 78, -60, 82], [-101, -40, -101, -16], [-132, -139, -39, 44, 83, -23]]