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.

Q: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

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

A: [67, 26, 66, 99]
****
Q: [[-46, -15, 32, -87, -14, 7], [-93, -14, -166, -17, 69], [-10, -193], [35, 55, 31, 5, 43]]

A:
[32, 69, -10, 55]
****