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:
[[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:
[[-62, 3, -118, -146, 75, -150], [3, -126, 64, -23], [64, 28], [-90, 57, 97, -92, -179]]

Ex Output:
[75, 64, 64, 97]


Ex Input:
[[-27, 56, -99], [-54, -63], [89, -131, -121], [-134, -30, 18, 26, -158], [-195, -157, 29, 70, 11], [33, -106, -126]]

Ex Output:

[56, -54, 89, 26, 70, 33]