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]: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]
[EX A]: [25, 32, 86, 96, -33, 84, 93]

[EX Q]: [[-182, -164, -2, 61, -59, -8], [96, -48, 12], [-194, -116], [-46, -102, 0, -142, -82, 91, 67], [-33, -2, -164, -154, -193, -119], [-139, 62, 17, 4, -171, 73, -38]]
[EX A]:
[61, 96, -116, 91, -2, 73]