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]: [[83, -95, 37, -7], [33, -23, -133, -134, 77], [52, -161, 1, 34, -123, -29], [-130, 51, 97, -29], [-14, 36, -88, 49, -199]]
[A]: [83, 77, 52, 97, 49]


[Q]: [[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]
[A]: [80, 88, 84, 99, 34]


[Q]: [[33, -8, -177, -18, -131, 54, -80], [-176, 50, 4, -169, -21, 100, -6], [74, 54, -191, -172, -127, 41], [58, -34, 65, -58, -66, -16, 90], [-151, -199, -36, -102, 39], [34, -42, 61, -36], [-162, 73, -107], [-150, -4, 38], [-47, 82, -71, 91, 56, -20, -13]]
[A]:
[54, 100, 74, 90, 39, 61, 73, 38, 91]