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: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

A: [98, -44, 98, 19, -1, 50, 98, -17, 48]
****
Q: [[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]

A: [-42, 30, 87, 34]
****
Q: [[11, -127], [-112, 59, -112, -103, 31], [17, -91], [80, -27, -56, 46, -8, -51], [2, -43, -2, 51, -105, 91, -121], [-115, -150, 27, -68, 5, -193, -99]]

A:
[11, 59, 17, 80, 91, 27]
****