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: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]

A: [99, 32]
****
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: [[24, 33, -146], [-10, -121, 37, -44], [-167, -165, -19, 33, 43]]

A:
[33, 37, 43]
****