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: [[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]

Output: [69, 65, -70, 55, 46, 38]


Input: Consider Input: [[-26, -109], [39, 84, 32, -156, -197], [-125, -101, 88, -75, 85], [-128, -199, -28, -163, 55, 69]]


Output: [-26, 84, 88, 69]