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: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]

Output: [75, 34, 96, 33, 21, 50, 17]


Input: Consider Input: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]

Output: [80, 56, 46, 29, 14]


Input: Consider Input: [[-184, 60, -171, -164, 78, -47], [-6, 62, 88, -1], [27, -186, 72, -175, -176, 78], [-37, -180, -75, -128], [-7, -55, -149, -33, -46, 63], [64, 40, -110, -113, -9, -117], [-75, 60, -81, -151], [36, 64]]


Output: [78, 88, 78, -37, 63, 64, 60, 64]