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:
[[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]

Ex Output:
[81, 84, -3, 93, -41, 21, 6, 87, -16]


Ex Input:
[[7, 42, -200, -138], [-113, -158, -17, -60, -38]]

Ex Output:
[42, -17]


Ex Input:
[[-190, -68, -31, 75, 10], [-194, -115, -1], [-130, -93, 47], [46, -83, -100, -91, -72, -57, 78], [-2, 65, -33, -51], [74, 57, -45, -107, 33]]

Ex Output:

[75, -1, 47, 78, 65, 74]