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]: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]
[EX A]: [83, 79, 34, 49, 11, 75, -6, 67, -96]

[EX Q]: [[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]
[EX A]: [9, 29, 22, 85, 77, 75]

[EX Q]: [[41, 8], [-77, 71, 85]]
[EX A]:
[41, 85]