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:
[[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]
answer:
[100, -120, -94, 63, 50, -139, 80, 56, 88]


question:
[[-132, 87, 9, -146, -184], [97, -169, -21, 52, 16, -182, -6], [-60, -2, -147, 55], [-111, -154, -41, 37, -97, -139, -111], [33, -113, -106, -92], [-13, 49, 66, -121, 61, -129, -124], [72, -107, -192, 86]]
answer:
[87, 97, 55, 37, 33, 66, 86]


question:
[[-109, -186], [-32, -173, 36], [44, 40, -187, -66, 86, -87], [-101, 76, -125], [18, -163, 51, -176, -3, 5, 75]]
answer:

[-109, 36, 86, 76, 75]