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]: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]
[EX A]: [64, 55, 92, 95, 72, -29, 63]

[EX Q]: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]
[EX A]: [22, -12, 60, 59, -8, 90]

[EX Q]: [[-163, -174, -119, -2, -189, -40], [-1, -64, -23, -128, -130, -31, -68], [-156, 13], [-55, -106, -102, -58, -121, -100]]
[EX A]:
[-2, -1, 13, -55]