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:
[[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]
answer:
[41, -44, 34, 86, 26]


question:
[[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]
answer:
[-111, 83, -8, 92, 55, 91, 70]


question:
[[70, -120, 35], [100, 49], [-42, -109, 67, 59], [-128, -88, 18, 90, 0], [30, 1], [47, -16], [-49, -171, 88], [-118, 87]]
answer:

[70, 100, 67, 90, 30, 47, 88, 87]