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, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

Ex Output:
[98, -44, 98, 19, -1, 50, 98, -17, 48]


Ex Input:
[[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]

Ex Output:
[33, 66, 95]


Ex Input:
[[-136, 60, -71, -22], [-111, 47, -165, -109, -67, -36], [-71, -193, -83, -150, 61, 27], [0, 49, -55, 42, -127]]

Ex Output:

[60, 47, 61, 49]