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]: [[-181, -160, -10, -6, -128], [78, -145, -191, -36]]
[A]: [-6, 78]


[Q]: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]
[A]: [95, 47, 66, 75, 33, 72, 9]


[Q]: [[-142, 94, 47, -152, -27, 90], [-148, -47, -74, -121, -147, -200], [84, -168, 16, -1, 88, -50, -140], [-79, -44, -188, 57, 9], [86, -9, -103, -200, -67, -57, 76], [-111, -171, -1, 42, 76, 69, -73], [-49, 88], [-170, -92, -44, -49, 29, 82, -155]]
[A]:
[94, -47, 88, 57, 86, 76, 88, 82]