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]: [[78, 47, -92, -13], [-96, -82, -2, -121, -170, 97], [-25, 34, -96, -66, -40, 65], [-13, 35, -59, 100, -164], [-39, -131], [-7, -166, -29, 22, -3, -100, -72]]
[EX A]: [78, 97, 65, 100, -39, 22]

[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]: [[2, 0, -87], [-128, -123], [21, -164, 23, 48, 6, 57, 86], [30, -50, 4, -162, -176], [-98, -120, 47, -148], [49, -22, -137, 78], [-24, 87, -99, -120], [93, -80, -116, -28, 20, -97, -150]]
[EX A]:
[2, -123, 86, 30, 47, 78, 87, 93]