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:
[[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]
answer:
[-42, 39, 83, 62, 10, 55]


question:
[[-186, -87, -112, -3], [-180, 50, -4, 45], [-89, -128, -195, -38], [51, -28, -10, -48], [-191, 10, -146, -98, 42, -64, 22], [-151, 54, -57], [-58, -90, 81, -35, -25, -172], [-155, -65, 76, -93]]
answer:
[-3, 50, -38, 51, 42, 54, 81, 76]


question:
[[-14, 26, -94, -51, 13], [74, -193, 100, 2, -110, 73, -61], [45, -163, -98], [61, 15, -132, 50, 4, -41], [-83, 30, -72, -108], [71, -96, 96, -165, -12, -156]]
answer:

[26, 100, 45, 61, 30, 96]