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]: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]
[EX A]: [64, 55, 92, 95, 72, -29, 63]

[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]: [[-171, -161, 5, 10], [-132, -35, -42, -108], [-76, -68, -43], [-61, -44, -162, 46], [-120, 74, -91]]
[EX A]:
[10, -35, -43, 46, 74]