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:
[[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]

Ex Output:
[76, -74, 73, 57, 41]


Ex Input:
[[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]

Ex Output:
[-68, 75, -10, 55, 89, 94, 52, 22, 96]


Ex Input:
[[43, -137, -137, 54, -139], [-132, -29, 63, -71, -192], [-185, 60], [14, -174], [-40, 89], [-102, -37, -56, -14]]

Ex Output:

[54, 63, 60, 14, 89, -14]