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]: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]
[A]: [39, 6, 91, -7, 52, 99]


[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]: [[10, -67, -63], [-196, -1, -194, 21]]
[A]:
[10, 21]