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.

[EX Q]: [[-162, -197, 57, -149], [71, -127, 21, -120, 56, -18, 82], [-18, 1, -152, -113, 5, -53], [-138, 28], [70, -65]]
[EX A]: [57, 82, 5, 28, 70]

[EX Q]: [[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]
[EX A]: [89, -13, 20, 92, 100, 13, 6, 88, 71]

[EX Q]: [[-171, -23, -145, -144, 59, -75, 88], [85, 41], [-86, -93, 23, -41, -82], [-179, -122, -130, -95, -111, 21, -8], [-179, 48, 2, 99, 35, -114, -8], [70, -78, -76]]
[EX A]:
[88, 85, 23, 21, 99, 70]