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]: [[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]
[EX A]: [-110, 37, 0, 24]

[EX Q]: [[-82, -50, 44, -81, 8, -40, -47], [57, -72, 38, 1, -158], [-7, -143, -15, 55, 2], [67, 50, 78, 15, 77], [5, -174, -101, -40, 8], [-38, -10], [-45, -138, -140, 13, -76, -37]]
[EX A]: [44, 57, 55, 78, 8, -10, 13]

[EX Q]: [[11, -166, -94, -14, -200], [-104, -185, 96, 54], [-35, -139, -20, -147, -184], [-11, -105, 40], [77, 90, -54, -28, 96], [60, -191, 50, -165, 34, -162], [57, 23, -87, -193, -145, -43], [44, -16, 60, -156]]
[EX A]:
[11, 96, -20, 40, 96, 60, 57, 60]