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, 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]: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
[EX A]: [82, -53, 34, 100, 65, 57, 65, 58, -101]

[EX Q]: [[57, -185, -1], [51, -184, -171], [34, -53, -105, -170, -140], [-76, -142, -81, 83, -138, -24, -93], [-122, -170, -44], [27, -13], [-196, -163], [28, 66, -153, -22, -170, 19], [37, -183]]
[EX A]:
[57, 51, 34, 83, -44, 27, -163, 66, 37]