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]: [[-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]: [[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]
[EX A]: [77, 20, 78, 69, 77, 24, -5, 45]

[EX Q]: [[38, 35, 59, 61, -126, -116], [-45, 88, -191, -63, -5, -26, 28], [-111, -25, -188, -167], [74, -112, 35, 86], [-161, 40], [-18, -157, -24, 92, 59, -43], [-1, 60], [-6, -17, 5, -153, -99, 85]]
[EX A]:
[61, 88, -25, 86, 40, 92, 60, 85]