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]: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]
[EX A]: [95, 47, 66, 75, 33, 72, 9]

[EX Q]: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]
[EX A]: [37, 32, 34, -3, 97, 97, 68]

[EX Q]: [[-167, -67, -56, 18], [-53, -172, 67, -153, -86], [-105, 42, 42, -59, -81, 95], [-37, -102, 70, -162, -10, -3]]
[EX A]:
[18, 67, 95, 70]