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: [[20, -141], [-153, 62, 13, -129], [-197, 78, 14, -101], [40, -136, -81, -138], [-182, 84], [47, -184, -16], [5, -28, -3, -174, -139], [91, -121, -61, 55, 42]]

Output: [20, 62, 78, 40, 84, 47, 5, 91]


Input: Consider Input: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

Output: [10, -59, 99, 48, 18, 80]


Input: Consider Input: [[-27, -39], [-121, 82, -113, -185, 37, -90, -89], [-128, -180, -1, 16, -157, -158], [-147, -100, -11, -166, -31, -121, -29]]


Output: [-27, 82, 16, -11]