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.

Ex Input:
[[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]

Ex Output:
[49, 79, 8, 70]


Ex Input:
[[-8, -195, -141, -165, -183, -5], [88, -22, -176], [93, 47, 11], [-2, -178, -76, -118, -193, -39], [-98, 22, -150, 67, -158, -133, -61], [72, -124, 63, -187, -45], [-193, -85, -48, -49, -17], [-119, 27, -119, -146, -50]]

Ex Output:
[-5, 88, 93, -2, 67, 72, -17, 27]


Ex Input:
[[-45, -56, -36, -52, -3, -172, -25], [-141, 1, -9, -168, 36, -53], [71, -56, 99], [-184, 57, 76, 7, 4, 95], [-102, -97, -167, -18, 38, 64], [16, -101, 90], [-99, -68], [-144, -12], [-89, 58, 6, -87]]

Ex Output:

[-3, 36, 99, 95, 64, 90, -68, -12, 58]