instruction:
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:
[[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
answer:
[82, -53, 34, 100, 65, 57, 65, 58, -101]


question:
[[-84, -63, 38, 60, 27], [-138, -24], [22, -166, 67], [68, -124, -107, 45, -122], [-34, 29, -9], [15, -117, 38], [-160, -130, -145, 40, -78]]
answer:

[60, -24, 67, 68, 29, 38, 40]