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]: [[-8, -195, -141, -165, -183, -5], [88, -22, -176], [93, 47, 11], [-2, -178, -76, -118, -193, -39], [-98, 22, -150, 67, -158, -133, -61], [72, -124, 63, -187, -45], [-193, -85, -48, -49, -17], [-119, 27, -119, -146, -50]]
[A]: [-5, 88, 93, -2, 67, 72, -17, 27]


[Q]: [[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]
[A]: [37, 75]


[Q]: [[92, -197, -73, -50, -195, -56, -172], [-11, -133], [-67, -52, 96, -136, -143, -34, 68], [76, -130, 93, -35, -190, -187, 48], [-67, -58, -88, -140, 91], [-96, -139, -13, -84, 88, -55], [40, 23, 86], [-164, -22, -38]]
[A]:
[92, -11, 96, 93, 91, 88, 86, -22]