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:
[[-40, -40, 89, -120, 33], [-157, -13, 7, 45], [35, -131, 87, -23], [-125, 77, 68, -106, -2], [89, -90, 15, -2, 42, -95, 72], [-4, -179], [-119, -79], [41, -12, -110]]
answer:
[89, 45, 87, 77, 89, -4, -79, 41]


question:
[[-60, -47], [0, -38, -83], [-199, -140, -188, -11, -82], [-84, -86, -6, -157, -11, 6, -43], [85, 34, -189, -52], [-50, 50, -191, -105]]
answer:
[-47, 0, -11, 6, 85, 50]


question:
[[98, -78], [-54, -16, -92, -4, -143, -155], [69, 13, 68, -3, -3], [100, -187, -136, -35], [-39, -184, 32, 91, -128, 39, -73], [-140, -198, -130, -120, -76, -133, 61], [2, -19, -149, -60, 42, -5]]
answer:

[98, -4, 69, 100, 91, 61, 42]