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.

Input: Consider Input: [[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]

Output: [91, -17, 64, 81, 54, 100]


Input: Consider Input: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

Output: [90, 98, 22, 85, 64, 77, 63, -152]


Input: Consider Input: [[-131, -182], [-50, -96, -116, 81, 89], [-178, -15, 60, -159, -175, -102], [-193, -156, -172, -89, -92], [-107, 82, 94, -54], [-74, 90]]


Output: [-131, 89, 60, -89, 94, 90]