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: [[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]

Answer: [-68, 30, 99, 15]


Question: [[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]

Answer: [-26, 74, 56, 71]


Question: [[-15, -81, -69, 12, -194, -177, 71], [-65, -67, -26]]

Answer:
[71, -26]