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]: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
[EX A]: [49, 34, 10, 52, 78, 31, 30, 18]

[EX Q]: [[76, -10, 56], [-177, -39, -40, 29, -17], [17, 77, 94, 58, 88, 39], [-2, 94, -166, -183, -48]]
[EX A]: [76, 29, 94, 94]

[EX Q]: [[-164, -32, -150, -71, -127, 61, 31], [33, -13, -98, -99, -171, -165], [-193, -72, -193], [42, -77, -92, -26, -191], [-136, 58, -146, 16, 56, 39, -190], [91, -4, -102, 55, -134], [-108, 100, -169, -108], [-90, 47, -101, -126], [32, -111, -136, -161, 65, 57]]
[EX A]:
[61, 33, -72, 42, 58, 91, 100, 47, 65]