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]: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]
[EX A]: [41, -44, 34, 86, 26]

[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]: [[-102, 45, 93, -29, 100, -192, -143], [-16, -129, 84, -100, -84]]
[EX A]:
[100, 84]