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: [[7, 42, -200, -138], [-113, -158, -17, -60, -38]]

Output: [42, -17]


Input: Consider Input: [[-169, -100, 98, 55, -83], [-191, -163, 76, -104, 67, 62], [-105, 72, -28, -58], [58, 1, -24, -98], [79, -22, -173, -125, -112, -157, -143], [-128, -10, 1, -121, 47, -180, -129], [-106, -11, -164, -79, 25, -118]]


Output: [98, 76, 72, 58, 79, 47, 25]