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: [[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]

A: [97, 45, 26, -42, 45, 44, 27, -42]
****
Q: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]

A: [97, 24, -43, 79, 51, 72]
****
Q: [[54, -55], [-64, 97, 69, -105, -153], [79, -160], [-153, -127, -28], [-124, -86, -150, -64, 52, -187], [73, -158], [-181, 48, -131, 47, -179, 65, 3], [10, -163, -75, 42]]

A:
[54, 97, 79, -28, 52, 73, 65, 42]
****