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: [[-23, 9, 22, -37, -98], [-115, -12], [-24, -60, 60, 20, -184, -165], [-190, -3, -123, 37, -132, 59], [-104, -159, -18, -8, -10], [-128, 8, 90, -93, 63, 45, -80]]

Answer: [22, -12, 60, 59, -8, 90]


Question: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]

Answer: [37, 32, 34, -3, 97, 97, 68]


Question: [[-153, -8], [-166, -124, -114, -80, 16, 71, -34], [-50, -190, 6, -100, 78], [74, -98], [-132, 32, -179], [-89, -147], [-82, -82, 48], [32, -113, 54, -148]]

Answer:
[-8, 71, 78, 74, 32, -89, 48, 54]