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: [[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]

Output: [33, 66, 95]


Input: Consider Input: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

Output: [41, -44, 34, 86, 26]


Input: Consider Input: [[13, -175, -48, -157, 16], [98, -133, 51, -6, -99, 65, 55], [-42, -33, 66], [-197, -85, -50, 59, -77, -27, -65]]


Output: [16, 98, 66, 59]