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: [[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]

A: [-3, 50, -38, 51, 42, 54, 81, 76]
****
Q: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

A: [60, -32, 68, 93, 24, 26, 7, 85]
****
Q: [[94, 43, -82], [18, -75, -114], [-148, -107, -146, 32], [-169, -154, -145], [-168, -118], [-107, -58, -54, 95, -151, -162, 38], [12, -108], [-62, -85, 62, -130, -7, -74, -172], [-127, -23, -160, 100]]

A:
[94, 18, 32, -145, -118, 95, 12, 62, 100]
****