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, 44, 83, -159], [-121, -81], [-49, -186], [61, -20], [97, -128], [0, -50, 29, -154, -159, 40, -68], [-30, 77, -132, -155, -1, -90]]
answer:
[83, -81, -49, 61, 97, 40, 77]


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:
[[59, -86, -92, 0], [-90, -5, -142, -182, 99, -191, 28], [15, -107], [-144, -188, 41, -30, -23, -150, -183], [-48, -161, -73], [-50, -178, -80, 17]]
answer:

[59, 99, 15, 41, -48, 17]