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: [[-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: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]

Output: [85, 82, 95, -111, 24, -112, 65, 65, 16]


Input: Consider Input: [[-82, -110, 59, -50, 48, -97, -178], [-160, -4, -51, -157, 21, 45, 12], [-108, -129, -185, -122, -114], [87, -70, -162, 6, 97, -62], [-84, 77, -95, -99], [-199, -29, -97, -193], [-195, 31, -188, 39, -65, -91], [50, -75], [-103, 26, 32, 27, -77]]


Output: [59, 45, -108, 97, 77, -29, 39, 50, 32]