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]: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]
[EX A]: [39, 6, 91, -7, 52, 99]

[EX Q]: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]
[EX A]: [25, 54, -45, 79, 96]

[EX Q]: [[-119, -137], [48, -177, -197, -85, -27, 26], [-171, -26, 20, -189, -150, -64, -93], [32, 23, -136, -17, -49], [-179, 0, -94, 48, -101, -71, -82], [28, 70], [-33, -12, -75]]
[EX A]:
[-119, 48, 20, 32, 48, 70, -12]