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: [[-144, -114, 61, -172, 43, 35, 40], [82, 54, -184, -82, -75, -105, 97]]

Output: [61, 97]


Input: Consider Input: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

Output: [100, 84, -63, -55, 78, 58, 86, 99]


Input: Consider Input: [[99, 79, 41], [51, -86, 53, -5, 21, -184], [-154, -142, -106, -101, 64, -181, 83], [57, -54, 15], [-18, 62, 1, 78, -41, -158], [-55, 7, 81, -151, 59], [-188, 43, 81, 74], [-24, 92, -107, -192, -21, -74]]


Output: [99, 53, 83, 57, 78, 81, 81, 92]