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:
[[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

Ex Output:
[2, 72, 60]


Ex Input:
[[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]

Ex Output:
[9, 83, 81, 93, 48, 2, -73, 50]


Ex Input:
[[-14, 48, -91, -9, 44], [-95, 73, -11, -94], [-6, -115, 56, -61, 70, -192]]

Ex Output:

[48, 73, 70]