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: [[68, 82, -140, -80, -74, -135], [-154, -62, -78], [5, -153, -4, -88], [98, -78, 78], [57, -145, -49, -22, -67, 100], [-40, -152, 56, 49, -93, -138, 48], [-168, -137, 64, -103, -117], [-38, 2, -126, -106, -192, -160, 54]]

A: [82, -62, 5, 98, 100, 56, 64, 54]
****
Q: [[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]

A: [-26, 74, 56, 71]
****
Q: [[-197, 70, -6, 40, -1, -87, 42], [82, -145, -54], [61, 57, -7, 89, 84, -105], [-60, -131, 67, 24, 16, -43, 80]]

A:
[70, 82, 89, 80]
****