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: [[-32, -76, -121, -152], [-72, -164, -165], [-56, 43], [38, -76, 59]]

Output: [-32, -72, 43, 59]


Input: Consider Input: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

Output: [51, 49, 86, 66, 74, -151, 49, 25]


Input: Consider Input: [[7, 44, -200, -130, -67], [-75, -37, 72, -161, -80], [-176, 48, -70, 69, -48, -161, -27], [-129, 75, -69, -169, -69, -49, -62], [-187, -136, -35, -70, 55, 57, -187], [-67, -126, -168]]


Output: [44, 72, 69, 75, 57, -67]