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:
[[-176, 88, 9, 97, -95, -136, 66], [-5, -51, -122, -165, -187, -26], [17, -62, -122, 47, -109, -36, -60], [-13, -113, -82], [86, 95, 37]]
answer:
[97, -5, 47, -13, 95]


question:
[[95, -100, -10], [-52, -130, -16, -86, -37, -181], [-126, -10, 3, -135, -67, 64, -5], [-101, -96, -155, -12, -63], [-130, -187, 20, 45], [-176, 87, -135, -75, -90, -189, -200], [-53, 74, -52, 29, -150], [-192, 48, -15, -148, -175], [75, -148]]
answer:
[95, -16, 64, -12, 45, 87, 74, 48, 75]


question:
[[39, -63, 21], [-134, -14, 12, 64, 37, -16], [92, -73, -100, -162, -9], [80, 21]]
answer:

[39, 64, 92, 80]