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.
--------
Question: [[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]

Answer: [9, -5, 62, -35, 92, -30, 91]


Question: [[34, -57], [17, -39, -14, -158, -113, -150], [30, -23], [-97, -1, -124], [5, -76, -14, -93, 3], [-5, -41, -198, -1, 37, -102, -11], [-157, 24], [-191, -80, 81]]

Answer: [34, 17, 30, -1, 5, 37, 24, 81]


Question: [[-119, -24, -38, -195, 81, -41], [-119, 96, -183], [-91, -25, -34], [10, -90, -53], [-75, 64, -20, -52, -58, -61], [-86, 13, 23]]

Answer:
[81, 96, -25, 10, 64, 23]