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: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

Output: [22, -12, 60, 59, -8, 90]


Input: Consider Input: [[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]

Output: [-84, 64, 62, -1, 88, -71]


Input: Consider Input: [[-179, 26, -172, -98, -134, -16], [-37, 34], [-135, 0, 48, 22, -68, -149], [-171, -147, 35, -41, -171, 82, -63], [80, -149, 18], [-105, 37, -65, -99, 32, 30, 56]]


Output: [26, 34, 48, 82, 80, 56]