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: [[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]

Output: [-76, -61, 22, 62]


Input: Consider Input: [[-85, -197, 23, -152], [-86, 62, 72, -58, 33], [-117, 76], [-195, -177, -170, 97], [30, 79, -50, 72, 54], [-23, 49, -16, -188], [32, 5], [-109, -31]]

Output: [23, 72, 76, 97, 79, 49, 32, -31]


Input: Consider Input: [[-6, -170], [45, -103, -20, 28], [-186, -122, 58, -134], [-127, -30, 99, -99, -19, -194, 95]]


Output: [-6, 45, 58, 99]