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, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]
answer:
[95, 63, 85, -7, 74, 40, 83, 80, 70]


question:
[[-50, -43], [8, -108, 3, 41, 100, -103], [-171, 61, -67, -75, -58, 47], [0, 82, -166, -101, 66], [-65, -87, -28, -194], [42, -162, 15, 39, -11, -126]]
answer:
[-43, 100, 61, 82, -28, 42]


question:
[[75, 25, -93], [-170, 16, -114, -81, -76, -11], [-192, 25, -99, 41, -133, -139], [65, 23], [-193, 25, 49, -75], [20, 21, -77], [-130, -60, -132, 26, -184], [-165, -12, -187, -88, -157, 26, -87], [40, -116]]
answer:

[75, 16, 41, 65, 49, 21, 26, 26, 40]