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, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]
answer:
[34, 39, 62, 66, 38, -85, -2, -53]


question:
[[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]
answer:
[-137, 8, 71, 30, 12]


question:
[[50, 17, 80, -170, -83, -131], [-89, -175, -54, -182], [-96, -104, 15, -186, -174], [75, -4, -171, -97, -145, 60], [-120, 48, -120, -6, -114, -90, -27], [-60, 24, 19, -2]]
answer:

[80, -54, 15, 75, 48, 24]