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: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]

Answer: [65, 75, 69, 44, 52, 16]


Question: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]

Answer: [62, 84, 96]


Question: [[84, -23, 41, 9, -69, -180, -68], [-90, -63], [-51, -24, -148, -10, 27], [44, -113, 66, -155, -80, -179, -173], [39, 78, 32], [25, 34], [79, 65, 17, 10, 11, -94, -69], [-1, -16, 14, -151, -176, -8, -27]]

Answer:
[84, -63, 27, 66, 78, 34, 79, 14]