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]: [[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]
[A]: [90, 65, 16, 93, 30]


[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]: [[-18, -111, 15, -90, 17, -194, 40], [-24, 94, 26, 36, -71], [56, -7, -111, -50, 30, -62], [-25, -50, -198, 91, -119], [-32, -137, -20, -138, -174, -149, 66]]
[A]:
[40, 94, 56, 91, 66]