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: [[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]

Output: [46, 34, 80, 76, 68]


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: [[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]


Output: [34, -30, 37, 55, 85, 61]