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]: [[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]: [[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]
[EX A]: [-4, 37, 90, 60, 55, 53, 83]

[EX Q]: [[-74, 5, -67, 67, 24, -3], [27, -80, -129], [-164, -114], [-190, -132, -121], [-134, -139]]
[EX A]:
[67, 27, -114, -121, -134]