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]: [[76, -185, 14, -102], [15, 67, 90, -188, -10], [88, -45, -12, 30, 90, -18], [-131, 47, -43, 0, -134], [-105, 94, 29, 2], [63, -152, -158, 92, -27, -147, -115]]
[EX A]: [76, 90, 90, 47, 94, 92]

[EX Q]: [[-14, -21, 36, -53, -155, -43], [-83, 77, 97, -108, -117, 62, 5], [83, -147, -157, -169, -41], [-10, 92, -27], [-180, 1, -47], [-104, 1, -149]]
[EX A]: [36, 97, 83, 92, 1, 1]

[EX Q]: [[34, -141, -181, -19, -149], [28, -68, 76], [-143, -164, 76, -76, -167], [36, 16, -125, 31, -174, -20], [-100, 85, -130, -163, -144, -64, -100]]
[EX A]:
[34, 76, 76, 36, 85]