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: [[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]

Output: [77, 20, 78, 69, 77, 24, -5, 45]


Input: Consider Input: [[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]

Output: [70, -16, 51, 80, -45, -14, 84, 89, 49]


Input: Consider Input: [[92, 95, -71, -18], [-39, -11, -120, 23, -199, -46, -188], [68, 77, -155], [66, 63, -93, -82], [-179, 72, -145, -66, 7], [-146, -82, -73], [85, -6, -73, -129], [-199, 33, 60, -200, 77, -58, -125], [-8, 83, -28, -55]]


Output: [95, 23, 77, 66, 72, -73, 85, 77, 83]