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]: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]
[EX A]: [16, 13, 97, 19, 36, 10, 60]

[EX Q]: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
[EX A]: [-33, 49, 37, -34, 92, 57, 19, 72, -92]

[EX Q]: [[-198, -49, -161, -153, 83, -100, -156], [-105, -187, 0, 47], [-36, -111], [-87, -21, 92, -176, -193, -118], [14, 74, -127], [-163, -7, 73, 28, -11]]
[EX A]:
[83, 47, -36, 92, 74, 73]