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: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

Output: [93, -100, 50, 56, 90, -87, 74, 82, 49]


Input: Consider Input: [[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]

Output: [93, 57, 98, 60, 15, -64, -9]


Input: Consider Input: [[-6, 58], [-137, -138], [32, 16, -135, -178, -33, 72, -16], [-79, -103, 2, -15, -102], [69, 84, -95, -77, -178, 62], [-118, -171, 80, -49, -64, -94], [-122, 66, -115, -61, -151, -84]]


Output: [58, -137, 72, 2, 84, 80, 66]