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]: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]
[A]: [28, 70, 52, 63, -145, 11]


[Q]: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]
[A]: [85, -8, 67, 45, 71, 91]


[Q]: [[96, -156, 17, -174, -105, -45, -75], [42, -75, -165, -12, -127], [-6, 89, -200, 65, -61, 49, -67], [-158, 46, -190, -45, 72, 61, -107], [-187, -184, 75, -164, -158, 44, -73], [-108, 79, -114], [-7, -136], [-136, -142, -138, -128, -148]]
[A]:
[96, 42, 89, 72, 75, 79, -7, -128]