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]: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]
[EX A]: [98, -11, 98, 26, 10]

[EX Q]: [[-200, 67], [100, -189, 2, -76, -44, -120], [61, -38, -71], [-105, 50, -71, -145, -107, 43, -1], [-173, -90, 1, -146, -15], [95, -4, 38], [-27, -157, -141, 12, -171, -42], [22, 20, -170, -57], [-148, -178, -12, 92]]
[EX A]: [67, 100, 61, 50, 1, 95, 12, 22, 92]

[EX Q]: [[-57, -82, -188, 26], [-84, -89], [59, 45, 62, -80, -194, 57], [20, -7, -155, -127], [96, 11, -185], [-118, -17, -96, 12, -117], [-13, -37, -167, -193, 21]]
[EX A]:
[26, -84, 62, 20, 96, 12, 21]