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: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]

Output: [36, 69, 66, 79]


Input: Consider Input: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]

Output: [97, 24, -43, 79, 51, 72]


Input: Consider Input: [[34, -27, -65], [32, 52, -74, -116, 67], [-187, -7, -92], [-21, -139, -22], [24, -17, -7, -187, -44, 60, 41]]


Output: [34, 67, -7, -21, 60]