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: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

Output: [82, -53, 34, 100, 65, 57, 65, 58, -101]


Input: Consider Input: [[92, -175], [-99, -116]]

Output: [92, -99]


Input: Consider Input: [[79, -82, -107], [40, -168, 48], [-77, -146], [-41, 14, -46, -187, -157, 33], [-22, -11, 83, -165], [-94, -57, -137, 25, -20]]


Output: [79, 48, -77, 33, 83, 25]