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:
[[-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:
[[51, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]
answer:
[96, 94]


question:
[[-91, -42, -86, 38, -111], [-193, -24, 50, -109, -3, -142, -100], [-151, -88, 97, -116, -36, 40]]
answer:

[38, 50, 97]