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: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]

Output: [86, 46, -128, 81, 40, 67]


Input: Consider Input: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]

Output: [25, 54, -45, 79, 96]


Input: Consider Input: [[-176, 87, 37, -136, 8], [81, 52, 54, 17, 30, -35], [-73, -188, -136], [-2, -48, -191], [42, -171, 28, 9], [-119, -128, 7, 73, -163, -17, -186], [-6, -197, 16, -26]]


Output: [87, 81, -73, -2, 42, 73, 16]