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: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]

Answer: [86, 46, -128, 81, 40, 67]


Question: [[-26, 27, -21, 89, 86, -164], [96, -168], [-189, -188, -69], [-14, -14, -126, 40, -65], [52, -23, -149, 17, 90], [-171, -190, 75, 40, -187, 35], [-108, 99], [-81, 98, -137, 59], [4, -13, -66, -24, 41, -68, -147]]

Answer: [89, 96, -69, 40, 90, 75, 99, 98, 41]


Question: [[13, -200, -18, -33, -174], [-89, -53], [-141, -82, -102, 74], [-77, 42, -91, -136], [-160, -162, -196, -191, -3, -171], [-128, -115, 35, -175, -79, -164, -138], [-29, 29, -145, -20, 36, 62], [-62, -106, -49, -154, -100, -109, -56]]

Answer:
[13, -53, 74, 42, -3, 35, 62, -49]