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:
[[78, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]
answer:
[78, 2, 43, 74, 67, 31, 40, 91]


question:
[[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]
answer:
[17, 69, 96, 75, 36, -151]


question:
[[60, -160, -74, -182], [-95, -173, -48, 60, 90], [-188, -168, -136, 32, 10, -151], [35, -35, 87, -27, -17, 26, -195], [-85, -76, -54, 58], [-40, 84, 24, 10, -143, 5], [72, 4, 86, -52, -37, 58, -163], [-36, 38, 97, 89, -30]]
answer:

[60, 90, 32, 87, 58, 84, 86, 97]