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]: [[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]
[EX A]: [97, -5, 47, -13, 95]

[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]: [[-110, -102, -86, -133, -22], [-169, -158, 74, -141], [42, 48, 28, 12], [-8, 31, -49, -91, 27, -141, -11]]
[EX A]:
[-22, 74, 48, 31]