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: [[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]

A: [78, 53, 93, 86, -31]
****
Q: [[17, -95], [4, -124, -1, -112, -184], [32, 98, -145, 91], [20, -200, -163, 25, 43, -39], [-166, -96, -39, -97, 52, -200, 97], [-111, -17, -183, 27, 34], [73, 62, -186, 59, -41, 8, -164], [22, -142]]

A:
[17, 4, 98, 43, 97, 34, 73, 22]
****