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]: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]
[A]: [-92, 90, 8, 74, -126, 6, 7, -86]


[Q]: [[-105, -189, 19, -65, -189, -88, -117], [39, 62], [44, -144]]
[A]: [19, 62, 44]


[Q]: [[-123, -163, 43, -5], [-109, -189, -123], [-48, 34, -64], [-87, 34, -39, 70, -153], [-44, -45], [-108, 55], [20, -103, 88, -38, -106], [68, 29, -23, 99, 91]]
[A]:
[43, -109, 34, 70, -44, 55, 88, 99]