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]: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]
[A]: [100, 84, -63, -55, 78, 58, 86, 99]


[Q]: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[A]: [53, 41, 80, 98, 91, 62]


[Q]: [[-161, -176, -171, -163, 71, 42], [-44, 16, -44, 85, 69, 63]]
[A]:
[71, 85]