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:
[[-150, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]

Ex Output:
[29, 85, 99, -7, -27, -3]


Ex Input:
[[5, -85, -188], [44, -175, 17, 82, 16], [-91, -101], [-172, -71, -147], [-90, 46, -27, 25, -122], [-23, -83], [-70, -18, 68, -98, -130, -177, -131]]

Ex Output:
[5, 82, -91, -71, 46, -23, 68]


Ex Input:
[[-46, -197, -7, -8], [-9, -71, -92], [92, 10, 50, -121, -53], [-60, -56, -3, -46]]

Ex Output:

[-7, -9, 92, -3]