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: [[-28, -118, -156, -57, -161], [-29, -157, -63, 77]]

Output: [-28, 77]


Input: Consider Input: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]

Output: [67, 26, 66, 99]


Input: Consider Input: [[-187, -64, 57, 97, 48, -109], [-176, 80, -27, -6, -155, 13], [-189, -77, -41, 43], [-182, -72, -153, -64, -38, 20, 89], [-187, -124], [-118, 26], [-17, 53, -176, -104, -179, -120], [-53, 98, -115, -83, -167, -164], [-81, -23, -200, -200, -170, 92]]


Output: [97, 80, 43, 89, -124, 26, 53, 98, 92]