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: [[-79, -50, -49, 57, -110, -78, -180], [-119, -90, 40], [81, -55, -64, -19], [17, -42, -76, -136, -58], [-74, 4, -161, -72]]

Output: [57, 40, 81, 17, 4]


Input: Consider Input: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]

Output: [88, 85, 41, 13, 42, 42, -35, 17]


Input: Consider Input: [[52, 16, 98, 45, -30, -41, -153], [-187, 63, 47, -13, 14, 56], [-24, -47], [-130, -100], [-189, -64, 22, 77, -193], [-123, 28, 4, -114], [4, -125, -23, -24, 10]]


Output: [98, 63, -24, -100, 77, 28, 10]