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:
[[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

Ex Output:
[91, 100, 86, 84, 13, 53, -32, 54]


Ex Input:
[[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]

Ex Output:
[-18, 95, 50, 81, 49, 91, 94, 59]


Ex Input:
[[73, -86, -24, -107, 43], [-26, -60, -75, -9, -165], [-134, 87, 97], [100, -87, -94, -163, -189, 87, 85]]

Ex Output:

[73, -9, 97, 100]