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]: [[-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]: [[-61, -173, -114, -165, -42], [88, 66], [-180, -162, 19, -92, 91, -102, -166], [-98, -156, -21, -13], [34, -133, -111]]
[EX A]: [-42, 88, 91, -13, 34]

[EX Q]: [[-13, -74, -40, -96], [-171, -51, -39, -164, -147], [-64, -24, -71, -146, -145], [-56, -114, 39, -173, -186]]
[EX A]:
[-13, -39, -24, 39]