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: [[-95, 0, -192, 42, -97, -175, 46], [-35, -75, 40, 81], [8, 80, -20, -159, -36, -128, 96], [3, -193], [-35, -13, -69, -2], [11, 89, -183, -49], [-67, -184], [-164, -183, -107, 77]]

Output: [46, 81, 96, 3, -2, 89, -67, 77]


Input: Consider Input: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]

Output: [-6, -59, 52, 14, 96, 37, 62]


Input: Consider Input: [[-37, -170], [-130, 72], [-61, 98, -161, -65], [64, -46, 25, -160], [-79, -87], [-4, 97], [-2, 11, -49, -99, 98, 88]]


Output: [-37, 72, 98, 64, -79, 97, 98]