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.
[[-127, 38, -4], [-129, -89, 96, -152, -197, -154, 87], [-147, 53], [-188, -106, 61], [-1, -102, -100, -58, -84, 10], [40, -144, 35, -199, -20], [47, -39], [-56, -196, 50, -72, -110, -54], [-3, 85, 75, -20, 69, 48, -135]]