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: [[96, -52, 68, -142], [-73, -61, -136, -199, 2], [-76, -160, -80, -125, -52, 19], [59, -116, -112, -40, -22], [-16, 43], [-187, 28, -125, -154, -93, -133, 38], [-46, -200, -124, -158]]

A: [96, 2, 19, 59, 43, 38, -46]
****
Q: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]

A: [-65, 43, 97]
****
Q: [[-146, -111, 36], [-139, -120, -21, 75, -163, -180, 41], [-67, -133, -176], [-56, -80], [12, 51, -126, -140], [30, -199, -173, 60, 1]]

A:
[36, 75, -67, -56, 51, 60]
****