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]: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]
[EX A]: [67, 26, 66, 99]

[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]: [[97, 62, 49, -87], [-126, -164, -129], [-35, -113, -70, 22, 31, -60], [8, -200], [-20, 57, -60], [-68, -163], [53, -154, -196, -61, -53, -187], [-81, 92, -5], [-85, 28, -143, 45, 51]]
[EX A]:
[97, -126, 31, 8, 57, -68, 53, 92, 51]