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]: [[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]
[A]: [-21, 86, 29, 100]


[Q]: [[35, -86], [-83, -51, -85, -31], [-179, -44, 91], [-18, 27, 28, 34, -142], [45, -109, -86, -35, -151, -74], [84, 80], [-67, 80, -136]]
[A]:
[35, -31, 91, 34, 45, 84, 80]