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]: [[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]: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]
[EX A]: [98, 30, 96, 87, 96, 67, 53]

[EX Q]: [[53, 74, -153, -71, -194, -70, -39], [73, 44, -188, 21, 24, 7], [29, -172, -26, 86, -105, -123], [42, -9, -127, -25, -93, 15], [-59, 2, 30, -78, -56], [-20, 89, -48, -163], [-185, -177, 86]]
[EX A]:
[74, 73, 86, 42, 30, 89, 86]