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:
[[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]

Ex Output:
[53, 55, 93, 90, 75, 10]


Ex Input:
[[-110, 98, -104, -154, -75, -61], [-194, 43, -85, 79, -95], [-112, -183, -70, 97], [-95, 65, -100, -127], [-185, 71, -108, -93, -1], [-48, -114, -149, 43, -101], [-72, -135, -135, -137]]

Ex Output:
[98, 79, 97, 65, 71, 43, -72]


Ex Input:
[[-107, -81, 34, 42, 76, -32, -116], [-35, -19, 85, -4, -30, 8, -92], [-104, -127], [14, -94, -164], [-83, 74, -74, 54, 32, 31, -141]]

Ex Output:

[76, 85, -104, 14, 74]