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]: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
[EX A]: [-111, 83, -8, 92, 55, 91, 70]

[EX Q]: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]
[EX A]: [53, 64, -34, 92, 22, 82, 85, 81, 43]

[EX Q]: [[-87, -182, -38, 10, -126, 53], [59, -171, -119], [-40, -126, -43, 66, -84], [-89, 17, -101, 84, 59], [-175, -17, -125], [96, -151, 32], [-146, 53, 33, -67, -173, 10, -97], [36, 18, -174, -47, -52]]
[EX A]:
[53, 59, 66, 84, -17, 96, 53, 36]