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: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]

Answer: [23, 99, 54, 29, 98, 95, 65, 88, 51]


Question: [[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]

Answer: [-135, 19, -152, -91, 22, -152]


Question: [[37, -42, -113, -24], [-123, -170, 67, 33, -140], [-55, -35, -148, -161, -134, 29], [-196, -13, -21, 54], [96, -146, 98, -159, -125]]

Answer:
[37, 67, 29, 54, 98]