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:
[[54, 83, -51, -150, -2, -16, -46], [-55, 91, -47, -111], [-31, 46, -124, -178, 21, -17, -72], [53, -71], [-122, -122, -119, -33, 6, 29], [-42, 77, 27, -38, -20], [22, -22, -81, -136, 52, -50, -125], [-119, -115, -194, -102, -200, -68, -186], [-33, -105, -155]]
answer:
[83, 91, 46, 53, 29, 77, 52, -68, -33]


question:
[[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]
answer:
[86, 23, 78, 68, -116, 72, 55, 53]


question:
[[-2, 34, 3, -14], [-87, -102], [-86, -152, -174, -135, 25, -152], [-95, -147, 12], [9, -67, 96, -148, -176, 10, -60], [1, -29, -200, -84, -193]]
answer:

[34, -87, 25, 12, 96, 1]