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.
[[55, -62, 36, -75, 58, 3], [-131, -195, -110, -104, -16], [-124, 36, -141, 0, -148, -67, -94], [-85, 61], [-86, -134, -171, -125, 92, 92, -93], [-48, -176, 48, -191, -184, -62, 61], [-36, -164, 66, -126], [-28, 89, -34, -130, -199, -143, -102], [-124, 0, -179, -162, 15]]