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: [[-112, -32, 5, -133], [-57, -42, -9, 22, 64]]

A: [5, 64]
****
Q: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]

A: [17, 85, 20, 70, 12, 73, 90, 59, 58]
****
Q: [[-12, -92, -53, 95, 96, 40, -178], [-135, -60, -19, -83, -68, -43, -49], [-166, -58, 25], [-96, -74, 81], [-69, -135, -113, 79, 38], [1, 8, -162], [-17, -18, 6, -69], [-162, -72, -5, -76], [80, -6, -5]]

A:
[96, -19, 25, 81, 79, 8, 6, -5, 80]
****