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: [[-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: [[-89, -107, -120, -129, -109, -16], [-66, -180, 68, 29, -113, -92], [-102, -113, -115, 80, -194], [-187, -134, -85, -174, -133], [-15, -124, -94, -186, -175, -54], [-95, -9, -56, -18, 94, -94, -56], [69, -24, 18, 17]]

Output: [-16, 68, 80, -85, -15, 94, 69]


Input: Consider Input: [[-50, -136, -76, -136, -65, 51, -133], [-194, 38, -178, 85], [-118, 53, -35], [-21, 26, -13, 80], [-167, -128], [-50, 74, -106, -50, -116], [-155, -57, -59], [-29, -157, -34, 51, -88]]


Output: [51, 85, 53, 80, -128, 74, -57, 51]