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:
[[-117, -191, 74, -91, 71], [-175, -177], [67, 65, -160], [-98, -28, -119, -66, 29, 7, -106], [-7, -132, -151], [-139, -163, -10, 40, 81]]
answer:
[74, -175, 67, 29, -7, 81]


question:
[[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]
answer:
[81, 84, -3, 93, -41, 21, 6, 87, -16]


question:
[[91, 32, 76, 83], [-179, -170, 25, -121], [23, -167, -24], [-169, -71, -143, -83, -32]]
answer:

[91, 25, 23, -32]