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 Q]: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]
[EX A]: [-26, -3]

[EX Q]: [[-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 A]: [81, 84, -3, 93, -41, 21, 6, 87, -16]

[EX Q]: [[-14, -34, -113, -138, -22], [77, -83, 95, -95, -153], [-5, -143, -46, -134], [-116, 14, -113, -131, -161, 13, -178], [-140, -50], [-71, -50, 59, -4, 51, 74, -31]]
[EX A]:
[-14, 95, -5, 14, -50, 74]