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.

[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]]
[A]: [93, -100, 50, 56, 90, -87, 74, 82, 49]


[Q]: [[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]
[A]: [24, 93, 61, 79]


[Q]: [[-113, -74], [-131, -95, -17, -65], [-109, -72, 56, -75], [30, -21, 60, 8, -92, 55, 19], [83, 62, -81, -45, 6, -52, 19]]
[A]:
[-74, -17, 56, 60, 83]