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.
[[92, 71, -35], [58, -196, -193, -84, -116, -31], [95, -102, -160, -171, -62, 27], [-199, 28, -48, -52], [-139, -4, -179, 51], [24, -51, 4, -189, -118], [40, -68, -184, -96]]