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: [[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]

A: [99, -20, 93, 56, 24, 100]
****
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: [[-154, -107], [49, -2, 72, -108, -154], [-177, 100, -109, -198, -29, -152]]

A:
[-107, 72, 100]
****