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]: [[-14, -21, 36, -53, -155, -43], [-83, 77, 97, -108, -117, 62, 5], [83, -147, -157, -169, -41], [-10, 92, -27], [-180, 1, -47], [-104, 1, -149]]
[A]: [36, 97, 83, 92, 1, 1]


[Q]: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]
[A]: [84, 1, 35, -78, 24, 87]


[Q]: [[71, -29, -22, -129, -49, -185, 29], [-182, 69, -146, -26, -156], [-179, -158, -55, -184, -149, -62, 81], [15, 12, -68], [44, 20, -82, 18, -96, 91, -86], [-65, 5, 1, -150, -163, -137], [-58, -80, -113, 46, -191, -149, -65]]
[A]:
[71, 69, 81, 15, 91, 5, 46]