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: [[-33, -17, 16, -125], [-15, 51, -194, -36, -4, 40], [-163, -197, -185, 99, -114, -157, 41], [35, -1, -14, -73, -149]]

A: [16, 51, 99, 35]
****
Q: [[43, -68], [-181, -117, -55, -105, 94], [73, -196, 90], [-166, 7, -88, 19, -89, -84, -55], [-18, 18, -79, -138, -143], [-76, 69, 0, -107, -27, 54]]

A:
[43, 94, 90, 19, 18, 69]
****