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: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]

Answer: [21, -38, 99, 89, 40, 46, 69]


Question: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

Answer: [28, 70, 52, 63, -145, 11]


Question: [[-66, 0, -183, -25, -71, 37, 4], [-176, -1, 85, -70, -175, 91], [-58, 38, 41, -34, 100, 77, 56], [87, -42, -183], [40, 88, -138, -25], [-196, 11, -168, -53, 67, -62], [13, -35, -4], [-98, -72, -70, 24, -21], [-168, -8, -185, -1, -66, -45]]

Answer:
[37, 91, 100, 87, 88, 67, 13, 24, -1]