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:
[[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]

Ex Output:
[78, -56, -80, 89, -112, 49, -93, 91, -94]


Ex Input:
[[-61, 7, 69, 6, -37], [-7, -82, 0], [-7, -78, -85, -29, 66, 50, -135], [34, -157, -198, -3, -91], [-124, -63, -141, -98, -188, -63], [-188, 71, -49, -13, -197], [76, 7, -159]]

Ex Output:

[69, 0, 66, 34, -63, 71, 76]