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:
[[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]

Ex Output:
[97, 23, -2, 61, 62, 68, 12, 15]


Ex Input:
[[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]

Ex Output:
[98, 56, 93, 13, 28, 59, 74]


Ex Input:
[[19, -72, -124, -166], [-159, 85, 19], [-162, -42, -183, -94, 52, -102, 92], [-171, -83, 61]]

Ex Output:

[19, 85, 92, 61]