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]: [[-150, 80, -128, -124], [-179, 83, -152, 11, -187, -1, -81], [88, -154, -20], [-59, -40, -39, -188], [-8, -53, 29, -181, 77], [-69, -7, 60, 22, -121], [-51, -96, -16, -120], [-79, 93, -86, -16, -96, -74, -187], [-39, -195, 86, 32]]
[EX A]: [80, 83, 88, -39, 77, 60, -16, 93, 86]

[EX Q]: [[-83, 24, -69, 26, 65, 98, 83], [-6, -181, 72, -139, -1, -80, 64], [48, -15, -94, -160, -61, -158, 41]]
[EX A]: [98, 72, 48]

[EX Q]: [[-119, -57, 15], [13, 68, 59, -77, -177], [-158, 80, -125, -67, 75, -82], [-3, -195, -88, -186], [-80, -122], [5, -75], [-154, -141, -75, 26, -193, -84], [-108, -144, -133, 85]]
[EX A]:
[15, 68, 80, -3, -80, 5, 26, 85]