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.

Example Input: [[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]
Example Output: [96, 2, 19, 59, 43, 38, -46]

Example Input: [[-127, 43, -163, -34, -6], [11, -75, -155, -25, 7, -180, -37], [-192, 11, -104, -54], [58, -177], [-59, -138, 2, 21, -33, -194, -135], [100, -111, -180, 15, 22], [-74, -116, 25, -117]]
Example Output: [43, 11, 11, 58, 21, 100, 25]

Example Input: [[-97, -13, -32, -166, -118], [-38, -14, 66, -110, -22, 60, -48], [-150, 96], [-185, 77, 54], [-172, -83, 72], [-47, -66, -200, -141, -96, -177, -7], [-196, -35, -140], [-141, -12, -161, 73, 69, -85, -38]]
Example Output:
[-13, 66, 96, 77, 72, -7, -35, 73]