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: [[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]
Example Output: [86, 23, 78, 68, -116, 72, 55, 53]

Example Input: [[-82, 59, 16, -170, -136, 39], [-40, -166, -55, 98, 96], [87, 75, 43, 27, -133], [-70, -62, 32, 79, -66, -138, 43]]
Example Output: [59, 98, 87, 79]

Example Input: [[59, 77], [-135, -38], [-115, -30, -126], [-192, 20, 100, 43, 40], [-193, -159, -9, -50], [2, -174, 23, -97, -37]]
Example Output:
[77, -38, -30, 100, -9, 23]