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:
[[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]
answer:
[64, 4, 44, 91, 57, 62, -3, -10]


question:
[[-48, -41, 45, -29, -161], [-163, -76]]
answer:
[45, -76]


question:
[[80, -12, 22], [89, -185], [66, -17, -144, -58, -40, -36, -93], [-197, -71, -193], [-110, 13, -146, 70, 51, -7], [-23, -1, -95, -30], [51, 60, 99, -4, 5, -125, -82]]
answer:

[80, 89, 66, -71, 70, -1, 99]