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: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]

A: [62, 84, 96]
****
Q: [[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]

A: [-57, 95, 65, -1, 100, 55, 31, 94]
****
Q: [[-81, -10, -115, 21, 38], [-51, -28, 16, 3, 72, -130, 82], [44, -41], [-130, 30, -147, -108, -99], [18, 15, -62, -51], [58, -127, 12, -178, 41, 8]]

A:
[38, 82, 44, 30, 18, 58]
****