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]: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]
[EX A]: [87, 7, 73, 69, 96, -106, 48, 84]

[EX Q]: [[-101, -168], [17, 42, -110, 20], [83, -36]]
[EX A]: [-101, 42, 83]

[EX Q]: [[-67, -25, -29, -13, -70, 48], [-26, 51], [-7, -156, 91, -41, -183, -123], [-129, 26, -20], [-193, 47, 28, 65], [9, -121, -32, -109, -9, -191]]
[EX A]:
[48, 51, 91, 26, 65, 9]