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:
[[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]
answer:
[51, 69, 92, 52, 82, 70, 65]


question:
[[-75, 10, -138, -42, 85, 8, -74], [18, 10, -70, 74, -88, -117, -145], [65, -145, 24, -193, -120, -186, -14], [-172, -115, -146], [-87, -180, -38, 77], [91, -50, -12, -23, -38, -89, 71], [-58, 81, -175], [-197, -145, 57, 94, -78, -184, -133], [-50, -183, -127, -77, 41]]
answer:
[85, 74, 65, -115, 77, 91, 81, 94, 41]


question:
[[-117, -165, -5, -59], [5, 71], [-172, -191, -5, 71], [-55, -65, -134, -3], [28, -157], [-187, 63, -114], [-109, -163]]
answer:

[-5, 71, 71, -3, 28, 63, -109]