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:
[[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]
answer:
[91, -17, 64, 81, 54, 100]


question:
[[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]
answer:
[89, 85, 85, 1]


question:
[[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]
answer:

[83, 79, 34, 49, 11, 75, -6, 67, -96]