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]: [[65, -176], [77, 97, -198, -72, -92, 10], [-147, 17], [-49, 33], [-49, -27, -78, -184, -94, -146, 14], [-193, -145, -81, -38, -161]]
[EX A]: [65, 97, 17, 33, 14, -38]

[EX Q]: [[-30, -21, 67], [-65, -176, 26, -20, -45, -93], [-102, -159, 28, -66, 41, 66], [99, -193, -188, -141, 65, -71, 72]]
[EX A]: [67, 26, 66, 99]

[EX Q]: [[-51, -109, -67], [-60, 5, -48], [-181, 18], [-61, -157, 58, 100, -93], [-141, 74], [-87, 81, -105, -162, -38]]
[EX A]:
[-51, 5, 18, 100, 74, 81]