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]: [[-54, -80, 72, -155], [-182, 65]]
[EX A]: [72, 65]

[EX Q]: [[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]
[EX A]: [-68, 75, -10, 55, 89, 94, 52, 22, 96]

[EX Q]: [[61, -73, -155, -54, -32, 68], [-118, -123, 76, -52, -28, 83, 92], [-30, 44, -190], [83, -82, 53, -151, 33, -141, -150], [-185, -165, -70], [1, 97, 73, -128], [43, -7, 70, 21, 73, -143, 51], [29, -192]]
[EX A]:
[68, 92, 44, 83, -70, 97, 73, 29]