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: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]

Output: [61, 77, 44, 93]


Input: Consider Input: [[-27, -28, 59, -2, -90, 50, -81], [9, 83, -62, 32]]

Output: [59, 83]


Input: Consider Input: [[-183, -136, -181, -163, -66, -56], [22, 31], [-133, 76], [-125, -65, -172, 80, 42], [-53, 67, -19, -6, -176], [40, 43, 28, -141, -47, 61], [-150, -146, -184, -74, -28, -90, 86]]


Output: [-56, 31, 76, 80, 67, 61, 86]