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:
[[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]
answer:
[-137, 8, 71, 30, 12]


question:
[[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]
answer:
[54, 30, 52, -59, 74, 43, -151, 64]


question:
[[-32, -117, 63, -62, -46, -56], [-107, -77], [-41, -140, -136, -194, 72], [-46, -122, 51, 31, -177], [-108, -6, 90], [-28, 24, -188, 98, -75, -171, -154]]
answer:

[63, -77, 72, 51, 90, 98]