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:
[[-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:
[[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]
answer:
[89, -13, 20, 92, 100, 13, 6, 88, 71]


question:
[[49, -80, -56], [49, 32, 58, -174, -86, -170, -2], [-89, -69, 70, 7, 28], [49, -181, 47, -171], [-107, -178, 10, 5, -121]]
answer:

[49, 58, 70, 49, 10]