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: [[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]

Output: [16, 51, 99, 35]


Input: Consider Input: [[35, -93, -67], [-110, 22, 11, -103, 51, -138, -99], [93, -85, 76, 62, -144, 86, -45], [-22, -117, 32], [17, -8], [-159, -25, -120, -119, 99, -127, -17], [-119, -159], [86, -50, -36, -134, -24, -85, -165], [-142, -56, -35, 81, 93, 34, -176]]


Output: [35, 51, 93, 32, 17, 99, -119, 86, 93]