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: [[-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: [[-200, -55, -94, 83, -144, -15], [83, -73, -2]]

A: [83, 83]
****
Q: [[-177, -51, -83, 37, -159, -15, 53], [1, -50, -197, -23], [62, -190, -25, -101, -101], [-22, -171, 100, -107], [82, -174], [41, -11, 3, 76, 10, -166], [-19, -171, -169], [-67, -164, -76, -181], [-132, -59, -62]]

A:
[53, 1, 62, 100, 82, 76, -19, -67, -59]
****