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: [[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]

Output: [34, -30, 37, 55, 85, 61]


Input: Consider Input: [[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]

Output: [76, -40, 87, 30, 27, 27, 51]


Input: Consider Input: [[29, -38, -11, -166], [-72, 19, 79, -28], [-100, -63, 40, -27, -135, 51, 62], [69, 88, 63, 19, -80, 86], [42, -106]]


Output: [29, 79, 62, 88, 42]