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]: [[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]
[EX A]: [90, 65, 16, 93, 30]

[EX Q]: [[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]
[EX A]: [18, 79, 47, 72]

[EX Q]: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]
[EX A]:
[20, -71, 9, 97, 46, 17, 90]