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:
[[99, -128, -21, -121, -117, -92], [-48, -9, -141, -18, -95], [-20, -29, -22, -193]]
answer:
[99, -9, -20]


question:
[[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]
answer:
[54, 44, 50, 12, 24, -28]


question:
[[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]
answer:

[77, 81, 85, 93, 54, 88]