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: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]

Output: [79, 83, 25, 75, 98, 92, 84, 92, 28]


Input: Consider Input: [[-116, 74, -148, -128, 83, -15, 92], [29, -115], [-186, -195, -2, -125, -22, -120]]

Output: [92, 29, -2]


Input: Consider Input: [[-74, -157, -30, -19, -3, -144, 26], [6, -89, 35, -118, -97, -90, -193], [91, -177]]


Output: [26, 35, 91]