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]: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]
[A]: [53, 34, 91, 40]


[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]: [[-18, -128], [-145, 32, 11], [23, -194, 22], [42, -29, -32, -88], [59, -153, 71, -11, -3, -145], [-20, 12, 53, -168], [-137, 51], [42, 78, -57]]
[A]:
[-18, 32, 23, 42, 71, 53, 51, 78]