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:
[[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]
answer:
[27, -10, 40, 78, 74, 22, 51]


question:
[[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
answer:
[93, -40, -72, 13, 91, 35, 33, 28]


question:
[[81, -88, -43, -38, -26], [-21, 4, 24, 48, 72, -52, -142], [-72, -149, 0, 13], [-86, -193, -173, -3], [59, -15, -134], [58, 92], [-114, 59, -135, -4, 85, 1, -66], [-40, 5, -190, -22, 58]]
answer:

[81, 72, 13, -3, 59, 92, 85, 58]