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]: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]
[EX A]: [82, 37, -135, 37, -132, 67]

[EX Q]: [[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
[EX A]: [75, 95, 70, 68, 100, -2, 15, 32, 97]

[EX Q]: [[23, 62, -143, 38, -115, -138], [-72, -16, -177, -82, -128, -135], [2, 68, -161, -8, 61, -185], [-143, 20, -58, 27, -153], [8, 21, 53], [66, -95, 75, 54], [-83, -5, -22, -108, 47, 51, -88], [-120, -60, -131, -62, -91, -195], [-167, -47, 69, 91]]
[EX A]:
[62, -16, 68, 27, 53, 75, 51, -60, 91]