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: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

Output: [75, 51, 10, 53, -43, 17, -111]


Input: Consider Input: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]

Output: [71, 71, -38, 60, 7, 97, 76]


Input: Consider Input: [[-51, -168, -98, 30, 39, -101], [46, -167, 49, -161, -154, 25]]


Output: [39, 49]