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: [[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]

Output: [83, 48, 83, 53, 35, -103]


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: [[-150, -28, 19, -109], [2, -189, -46, 84, 15, -87], [-57, 1, -59, -81, -197], [64, -110, 41, 82, 19, 99, -82], [29, -7, -56, 96, -148, -146, -150], [-70, -110, -108, -198], [-22, -10, 32], [1, -129, -112, 71, -195, -10], [19, -42, -112]]


Output: [19, 84, 1, 99, 96, -70, 32, 71, 19]