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]: [[79, -173, 27, 69, -53, -140, -166], [-198, -73, 95, 10], [82, -186, -168, -94, -6], [52, -73, 66, -106, 48, -37], [-78, -67, -36, -147, -18, -11]]
[EX A]: [79, 95, 82, 66, -11]

[EX Q]: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]
[EX A]: [93, -100, 50, 56, 90, -87, 74, 82, 49]

[EX Q]: [[70, 15, -181, 81], [-103, -38, -177], [-11, -4, 19, 21, -97, 64]]
[EX A]:
[81, -38, 64]