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:
[[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]

Ex Output:
[94, 24, 12]


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:
[[-65, -15, 0, -18, -100], [-154, -26, 18, -54, -137, 4, -172], [-77, 32, 59, -152, -144, -195], [-97, 91, 83, 34, -173, -57], [60, -191, 17, -162, -75, -9, -100]]

Ex Output:

[0, 18, 59, 91, 60]