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: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]

A: [76, -74, 73, 57, 41]
****
Q: [[78, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]

A: [78, 2, 43, 74, 67, 31, 40, 91]
****
Q: [[89, -79, -80], [-145, -188, -112, -188, -102, -103], [-98, 24, -69], [-96, -23, 69, -150, -68, -35], [-84, -68, 97, -10, 31], [-161, -93]]

A:
[89, -102, 24, 69, 97, -93]
****