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]: [[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]
[EX A]: [85, 21, 34, 90, 81, 32, 77, 65, 97]

[EX Q]: [[34, 13, -17], [-7, -151, -40, 78], [-199, 16, 80, -63, -167], [-23, 89, -19, 13, -156], [-42, -42], [-8, -25, 95, -62, 66, 100, 8], [-106, 21, -102], [-121, -75, -144, -162]]
[EX A]:
[34, 78, 80, 89, -42, 100, 21, -75]