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: [[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]

A: [34, 17, 30, -1, 5, 37, 24, 81]
****
Q: [[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]

A: [-41, 13, 43, 88, 15, 32, 33, 57]
****
Q: [[-23, -114, -40, -92, 2, -11, 81], [14, -148], [12, -86, 75, -179, -175, -197, -49], [-62, -187, 69, -42], [-52, 25, -194, 15, -33, 49, 29]]

A:
[81, 14, 75, 69, 49]
****