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: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

A: [55, 21, 75, 84]
****
Q: [[77, 52], [-25, -37, 13, 77, 88, -15, -158], [60, 86, -7], [78, 7, -132], [99, -94, -185, -158], [34, -90, 83, -81], [-21, -63, -161, 47, 12, 95], [59, 29], [-45, -57, 96, -170, 76, -70]]

A: [77, 88, 86, 78, 99, 83, 95, 59, 96]
****
Q: [[60, -164], [-151, 17, -40, -63], [-17, -105, -1], [-87, 36, -81], [-150, 49, -155, 21, -25], [-49, -48, 29, -81, -166], [-93, -195, -200, -95, -194], [-88, -62, 54, 100, -133, 21, 63], [65, -63, -192]]

A:
[60, 17, -1, 36, 49, 29, -93, 100, 65]
****