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: [[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]

Output: [78, 70, 89, 9]


Input: Consider Input: [[57, 81, -73, 26], [-40, -99, 67, -180, 25], [75, 86, -116, 56, -141, -111], [-127, 59, -108, -86, -63, 24, -144], [-9, -161, 75, 26]]

Output: [81, 67, 86, 59, 75]


Input: Consider Input: [[-44, -86, -61, 42], [-57, -156, -95, 55, -34, -89], [-60, 0, 81, -187, -172, -91], [-1, 1, -141, -60, -86], [-16, -40, -126, 38], [-50, -172, -75, -110], [-101, 18, 7, -6, -11, -81]]


Output: [42, 55, 81, 1, 38, -50, 18]