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: [[7, 42, -200, -138], [-113, -158, -17, -60, -38]]

Output: [42, -17]


Input: Consider Input: [[-198, -26], [-126, -188], [-169, 5, -181, 23, -158], [-175, 64, -109, -107, 95, 44, -7], [-118, -66, 100, 24], [13, -90]]

Output: [-26, -126, 23, 95, 100, 13]


Input: Consider Input: [[-106, -57, 26, 91, -166], [-155, -131, -188], [84, -185, -35, -6], [-82, -172, 30, -75], [78, -80, 83, -158], [63, -80, -38, 70, 62, -183, 88], [-103, -39, -134, -46, -116, -138], [-80, -180, 40]]


Output: [91, -131, 84, 30, 83, 88, -39, 40]