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: [[54, 83, -51, -150, -2, -16, -46], [-55, 91, -47, -111], [-31, 46, -124, -178, 21, -17, -72], [53, -71], [-122, -122, -119, -33, 6, 29], [-42, 77, 27, -38, -20], [22, -22, -81, -136, 52, -50, -125], [-119, -115, -194, -102, -200, -68, -186], [-33, -105, -155]]

A: [83, 91, 46, 53, 29, 77, 52, -68, -33]
****
Q: [[-54, 44, 83, -159], [-121, -81], [-49, -186], [61, -20], [97, -128], [0, -50, 29, -154, -159, 40, -68], [-30, 77, -132, -155, -1, -90]]

A: [83, -81, -49, 61, 97, 40, 77]
****
Q: [[84, 98, -6, -23], [72, -61, -137], [-88, 2, -92, -198, 35, -1, -167], [7, -149, 43, -105, 37, -2], [93, -130]]

A:
[98, 72, 35, 43, 93]
****