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]: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[EX A]: [60, -32, 68, 93, 24, 26, 7, 85]

[EX Q]: [[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]
[EX A]: [24, 93, 61, 79]

[EX Q]: [[-176, 2, 81, -21, 67, -39, 34], [-129, 92, -73], [20, 36, 70, -60, -47, -156], [-81, -5, -15, 38, -174, 26], [-154, -57, -135, -173, 68, -8, -187], [-181, -141, -72, 52, -84, -122], [42, 36, -40, -112, -10], [54, 23, -66, -54]]
[EX A]:
[81, 92, 70, 38, 68, 52, 42, 54]