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: [[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]

Output: [73, 26, 81, 48, 31, 25, 44, 31]


Input: Consider Input: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]

Output: [89, 47, 19, -36]


Input: Consider Input: [[62, -27, -196, -45, -149], [-173, -171, 24], [-24, -84, -123, -1, 83, -19, 83], [-7, -172, 98, -84], [-106, -130, -97, -157, -141, 79]]


Output: [62, 24, 83, 98, 79]