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]: [[42, -42, -94, 25, -125], [-141, -138, -170, -87, -121]]
[A]: [42, -87]


[Q]: [[-168, 10, 13, 20, -132, -173, -1], [-12, -101, -91, 97], [61, 89, -80, -37]]
[A]:
[20, 97, 89]