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: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]

Answer: [76, 41, 90, 32, 39]


Question: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]

Answer: [19, -96, 60, 50, 63, 58, 92, 67]


Question: [[-181, -158, -52, -191], [-89, -67, 100, -102, -116, 66], [-43, 83], [-92, -106, -172, 57, -36, 6, 64], [-108, -141, -77, -183, 32], [-198, 55, -95, -180, 5, 65]]

Answer:
[-52, 100, 83, 64, 32, 65]