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]: [[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]
[A]: [-26, 74, 56, 71]


[Q]: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
[A]: [82, -53, 34, 100, 65, 57, 65, 58, -101]


[Q]: [[14, -123, 15, -192, -176, 42], [-100, 59, -84, 48, 20, -143, 59], [-117, 3, 70], [-158, -20, -84, -134, -194, -7, 13], [11, -107, 77, -187, -30, -128, -68], [-41, 42, -138, 70, -181, -180], [0, -94, 61, -102, -119, 3, 82], [85, -154, -40, -133, -63, 83, 77], [-134, 28, 99, 3, -136]]
[A]:
[42, 59, 70, 13, 77, 70, 82, 85, 99]