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: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]

Output: [-61, -68, -103, 97]


Input: Consider Input: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

Output: [87, 7, 73, 69, 96, -106, 48, 84]


Input: Consider Input: [[-79, 27, 66, 62, 97, 70], [-46, -137, -126, 67, -157, -151, -150], [19, -194, -92, -151], [-22, 72, -7, -159], [-182, -188, -76, 47], [99, -45, -85, -88, 9, -37, -22]]


Output: [97, 67, 19, 72, 47, 99]