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: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]

Output: [88, 85, 41, 13, 42, 42, -35, 17]


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: [[49, -15, 33, -178, -161], [-126, -105, -188, -167, 62, -4], [-139, -116, -86, 55, -184, 25], [91, -70, -183, -4], [13, 30, -122], [-36, -171, -27, -72], [-50, -21, -9, -5], [-184, 90, -86, 88, -161, 17, 40]]


Output: [49, 62, 55, 91, 30, -27, -5, 90]