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: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]

Output: [36, -23, 76, 20]


Input: Consider Input: [[-42, -57, 13, -41], [45, -68, -199]]

Output: [13, 45]


Input: Consider Input: [[-25, 90, -40, -19, -84, -74, -31], [39, -79, -17, -124, -173, -97, -169], [9, -48, -146, 38, -89, -17], [-142, -189, 75, 3, -123, 43, -118], [-58, 45, 75], [-183, 28, -171, 62, -44, -67, -103], [-84, -125, -156, -190, 54, -196, -150]]


Output: [90, 39, 38, 75, 75, 62, 54]