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: [[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]

A: [71, 44, 78, 87, 68, 91]
****
Q: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]

A: [-121, 80, 98, 56, -17, 10, 55]
****
Q: [[-129, -39, 43, 63, 98, -91, -100], [-151, -58, -147, -91, -141, -170, -78], [56, -118, 30, -10, 37, -147]]

A:
[98, -58, 56]
****